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. Write
briefly:
a. What
is use of Big O notation?
b. Define
time space trade off.
c. List
various applications of Priority Queue.
d. What
are various advantages of linked lists over
Arrays?
e. Explain
the need of garbage collection in dynamic
memory allocation.
f. What
is Threaded binary tree?
g. What
is Post Order Traversal ? Explain with the help
of an example.
h. Differentiate
between linear search and binary search.
i. Write
an algorithm to perform bubble sort on an array of elements.
j. Explain
concept of Heap.
Section
–B
2. What
is data Structure? Explain various operations that can be
performed on Data
structures.
3. What
are various differences between stack and queue? Explain
in detail
implementation of stack using array and linked list.
4. Write
algorithm for:
a. Merge
Sort
b. Heap
Sort
5. What
is Recursion? write an algorithm to find factorial of a
number using recursion.
6. Define
Binary tree. Write an algorithm for post – order traversal
of binary tree.
7. Suppose
a sequence of number is given:
5,1,25,15,4,46,99,37,22,10.
Explain sorting of
given sequence using:
a) Insertion
Sort
b) Bubble
Sort
c) Quick
Sort
0 comments:
Post a Comment
North India Campus