B.

Tech DEGREE EXAMINATION MAY/JUNE 2011 Semester Department of Computer Science Engineering Time : Three hours marks PART A (10 x 2 = 20 marks) 1. What is meant by list ADT? 2. How do you test for an empty queue? 3. What are the applications of binary tree? 4. What are the different types of traversing? 5. What do you mean by hash function? 6. What do you mean by disjoint set ADT? 7. Define indegree of a graph? 8. Define biconnectivity. 9. How to solve problem of recurrences? 10. What is the main difference between greedy method and dynamic programming? PART B (16 X 5 = 80 MARKS) 11(A) Explain in detail about List ADT and its operations. (16) OR 11(B) Write an algorithm for inserting and deleting an element from Doubly linked list?Explain linear linked implementation of Stack and Queue? 12(A) Explain Representing lists as Binary tree?Write algorithm for finding Kth element and deleting an element? Maximum : 100

OR 12(B) Explain Binary heap and basic operations of heap with procedure. (16) 13(A) Explain collision resolution strategies with examples. OR 13(B) Explain in detail about Hashing technique. (16)

14(A) Explain Depth first and breadth first traversal? OR 14(b) ) Explain the concepts of Minimum cost spanning tree

with example(16) 15(a) Discuss in detail about The Analysis of algorithm. (16) OR 15(b) Explain in brief about algorithm analysis and explain about Asymtotic Notations.