DS Test1 QP
DS Test1 QP
Part - A 10 X 2 = 20 Marks
Part - B 5 X 16 = 80 Marks
14. a. Give the properties of B-tree and explain operations with an examples (13)
(Or)
b. Explain briefly about mergeable heap operations (13)
15. a. Write a routine to insert binary search tree and insert 8,5,19,15,20,3 (13)
(Or)
b. Write a routine for in order, pre order, post order traversal for the below BST (13)
Part - C 1 X 15 = 15 Marks
16. a) Differentiate best, average and worst-case running time analysis and explain how the three
analysis can be done for Linear search and Binary search of an array. (7+8)
(OR)
b) Show how to decrease a key of node in Fibonacci heap in constant time and how to delete a node
in heap in O(D(n)) amortized time. (15)