GOVERNMENT COLLEGE OF ENGINEERING, ERODE – 638 316.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
CP4151 ADVANCE DATA STRUCTURES AND ALGORITHMS
INTERNAL TEST I
Units covered : 2 Units Max. Marks : 100 Marks
Class : I SEM M.E. - CSE Duration : 3Hours
Part - A 10 X 2 = 20 Marks
1. What is amortized efficiency?
2. Define time space trade of with example.
3. What is recurrence relation?
4. What is algorithm? Give its criteria.
5. Give the analysis for linear search.
6. Why don’t we allow a minimum degree of t=1 for B tree?
7. Show all legal B-tree of minimum degree 2 that represent
{1,2,3,4,5}.
8. Draw a binary search tree for the following list
{60,25,75,15,33,44}.
9. Define disjoint sets. What are its operation?
10. How to bound maximum degree in Fibonacci heap?
Part - B 5 X 16 = 80 Marks
11. a. i. Describe asymptotic notations (8)
ii. Prove that 3n3+2n2= O(n3); 3n ≠ O(2n) (5)
(Or)
b. Elaborate program performance measurements in detail (13)
12. a. i. Explain briefly about the Substitution method (8)
ii. Explain briefly about the recursion tree method (5)
(Or)
b. Explain the importance of efficient algorithms (13)
13. a. Explain time complexity and space complexity with examples (13)
(Or)
b. Explain briefly about red black tree and its operations (13)
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)
*** Best Wishes ***
