0% found this document useful (0 votes)
26 views2 pages

10 Data Structures Feb Mar 2024

Uploaded by

bangyaismi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views2 pages

10 Data Structures Feb Mar 2024

Uploaded by

bangyaismi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

I lllillll illll lll lllll lllll lill llll NP - 393

lo
I Semester B.C.A. Examination, February/March 2024
(NEP) (F + R)
COMPUTER SCIENCE
Data Structures

Time : 2Yz Hours Max. Marks : 60

lnstruction : Answer all Sections. flf'


-;- \
jl

SECTION _ A - '.f

I. Answer any four questions. Each question carries 2 marks. (4x2=8)

1) What is non-linear data structure ? Give two examples.


2\ What is column major representation of multi-dimensional array ? Give an
example.
3) What is stack ? Write stack overflow condition.
4) What is circular queue ? Write the advantage of circular queue over linear
queue.
5) What is AVL Tree ? Give an examPle'
6) What is hashing ? Write any two techniques for choosing a hash function.

SECTION _ B

ll. Answer any four questions. Each question carries 5 marks. (4x5=20)

7) What is algorithm ? Explain best case, average case hnd worst case
complexity of linear search algorithm.
*.1

8) Write an algorithm to delete an element from an array.


9) Write a C program to find GCD of;three numbers.
1O) Evaluate the following post fix expression using stack.
73+84-*.
11) Construct a Binary search Tree (BST) for the given list.

2 7 3 11
L
15 I 19

P.T.O.
NP - 393 Illlilfl1ilililililtililililtil
12) What is graph ? Explain the BFS algorithm through queue forthe following
graph :

SECTION -C
lll. Answer any four questions. Each question carries g marks. (4x8=32)
13) a) what is abstract data type ? Explain queue as ADT. 4
b) Write a C program to check whether a given matrix is sparse matrix
I --'
or not. 4
14) a) Write a C function to insert an element at a position in a singly linked
list. '----- 4
b) Wh?t is the difference between doubly linked list and circular linked
list ? Giveexamples 4
15) a) example.
Explain recursion with an 4
b) sort.
Write a program to perform selection 4
16) What is queue ? Write the linear queue insertion and deletion function.
17) a) what is Binary Tree ? write a c function to perform preorder
traversal. 4
b) write the pre-order traversal of following binary tree. 4

18) a) Define collision. Explain any 3 collision resolution techniques. 4


b) Write a C program to perform binary search. 4

You might also like