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
Q1)
a) What
is a post order traversal?
b) What
is the best and average case of binary search?
c) What
is a binary tree?
d) How
a binary tree can be represented as alary structure?
e) What
is an complexity of an algorithm?
f) What
is a big O notation?
g) What
are the Pointers of queue?
h) How
a doubly link list is represented?
i) What
is a Binary Search Tree?
j) What
is the basic principle of bubble sort.
Section - B
Q2) Write
algorithm for :
(a) Binary
search.
(b) Merge sort.
(c) Radix sort.
Q3) Construct
the binary tree for the following expression
(2x
- 3z + 5) (1* -, + 8).
Q4)
Suppose a binary tree T is in the
memory. Write a recursive
algorithm or C program which find the number of nodes
in T.
Q5) What are the various operation possible on
a doubly link list.
Explain with the algorithm and graphically.
Q6) What
are the various operations possible on stacks.
Q7) What
is the post fix and prefix representation of the
following expression
(A * (b + c) ) +
(b/d) * a* z.
0 comments:
Post a Comment
North India Campus