ANNAI MATHAMMAL SHEELA ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY INTERNAL ASSESSMENT TEST II

Data Structures and Algorithm Class : II EEE A Max. Marks : 50 PART A 1. Define an AVL tree. 2. What is the minimum number of nodes in an AVL tree of height 6? 3. What is splay tree?. 4. State the properties of B-Tree. 5. Define hashing and provide its applications. 6. Differentiate separate chaining and linear probing. 7. What are the different methods of representation of a graph? 8. What is DAG? 9. Define a graph. Write down its applications. 10. Write the adjacency list of the following graph. 1 4 2 Date: Time: 1.30 Hrs. 10 x 2 = 20 Marks

3 B PART B (Answer any three) 3 x 10 = 30 Marks 11. i) Write the procedure for inserting nodes in an AVL tree. (4) ii) Show the resulting of inserting 2,1,4,5,9,3,6,7 into an empty AVL tree. (6) 12. Explain in detail the various hashing techniques. (10) 13. Explain the shortest path algorithm with an example. (10) 14. Write an algorithm for insertion and deletion operation of binary heap. Show the result of inserting 35, 25, 60, 42, 12, 8, 50 and delete the Minimum element from a binary heap. (10) 15. What is Topological Sort? Write down the pseudo code to perform topological sort And apply the same to the following. (10) 1 2 1 4 3 5

*****************************All The Best******************************