Roll
No....................
Total
No. of Questions : 07
Paper ID [802081
(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
Ql)
a) Name the application
areas of trees.
b) Define doubly linked
list.
c) What is dynamic
storage management?
d) Write short note on
recursion.
e) Define time-space
trade off.
D What is prioritypsa
queue?
g) What are the
advantages of linked list over arrays?
h) Give advantage of
binary search algorithm
r) List the various
types of queues.
j) What are the various
non-linear data structures?
Section - B
Q2) Write an algorithm
for preorder, inorder and postorder traversal in a tree.
Q3) Write short notes
on:
(a) Garbage collection
(b) Quick sort
algorithm
Q4) Write an algorithm to sort integers using
selection sort.
Q5) What do you mean by
recursion? Write an algorithm to find factorial of a number using recursion.
Q6) List the various
operations possible on a singly linked list? Explain with diagrams.
Q7) In what way, doubly
linked list is better than single linked list. Give examples.
0 comments:
Post a Comment
North India Campus