10 Data Structures Feb Mar 2024
10 Data Structures Feb Mar 2024
lo
I Semester B.C.A. Examination, February/March 2024
(NEP) (F + R)
COMPUTER SCIENCE
Data Structures
SECTION _ A - '.f
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
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