Roll
No....................
Total
No. of Questions : 07
Paper ID [B0208]
(Please fill this Paper
ID in OMR, Sheet)
BCA (Sem. – 2nd)
DATA STRUCTURES (BC -
204)
Time
: 03 Hours
Instruction
to Candidates:
1) Section - A is
Compulsory.
2) Attempt any Four
questions from Section - B.
Section - A
1.
a. What
is time space trade off? Explain with example.
b. What
is used of Big O notation in data structure?
c. List
various applications of priority queue.
d. Explain
how multi dimensional array is represented in
memory.
e. Write
an algtorithm to traverse a linked list.
f. Explain
how threaded binary tree is different from
binary tree.
g. What
is average and worst case complexity of merge
sort and insertion sort?
h. What
is garbage collection? Discuss its need.
i. What
are various applications of linked list?
j. Explain
how graph is represented in memory.
Section-
B
2. Define
data structure? What are its different types? Explain
various operations that
can be performed on data structures.
3. What
is stack? How it is different from queue? Write
algorithm to implement stack
by using an array and linked list.
4. What
is bubble sort? Explain its working. Sort the following data using bubble sort.
44 33 11 55 77 90 40 60 99 22
88 66.
5. What
is binary tree? How it is different from binary search tree?
Write and explain
the pre traversals algorithm for traversing a
binary tree.
6. What
is linked list? Explain the advantages of linked list over an
array and vice
versa. Write an algorithm to insert a node in
sorted linked list.
7. Wrote
note on the following :-
a. Linear
search and binary search.
b. Quick
sort.
0 comments:
Post a Comment
North India Campus