Professional Documents
Culture Documents
DS 2017-18
DS 2017-18
a. What do you understand by time space trade off? Explain best, worst and average case
r.c
algorithm? – Justify.
an
c. Define spanning tree. Also construct minimum spanning tree using prim’s algorithm for
tR
d. Define tree, binary tree, complete binary tree and full binary tree. Write algorithms or
function to obtain traversals of a binary tree in preorder, postorder and inorder.
e. Construct a B-tree on following sequence of inputs.
10, 20, 30, 40, 50, 60, 70, 80, 90
Assume that the order of the B-tree is 3.
SECTION C
1|Page
www.FirstRanker.com
4. Attempt any one part of the following:
www.FirstRanker.com 7x1=7
www.FirstRanker.com
om
r.c
ke
an
i. Hashing Technique
.F
i. Heap Sort
w
2|Page
www.FirstRanker.com