(Established under section 3 of UGC Act,1956)

Course & Branch :M.E/M.Tech - CSE/IT/W-CSE/W-IT Title of the Paper :Data Structures and Algorithms Max. Marks :80 Sub. Code :6C0501-7C0501 Time : 3 Hours Date :14/12/2009 Session :FN

PART - A Answer ALL the Questions 1. 2. 3. 4. 5. 6. What is Recursion Free Method? Explain. Explain Bucket Sort with Example. What are Splay Trees? Explain.

(6 x 5 = 30)

Explain about Stack, Queues and its Operations. Explain the elements of Dynamic Programming. Explain Breadth First Search with Example. PART - B Answer ALL the Questions (5 x 10 = 50)

7. 8. 9.

Explain in detail mathematical Notations and Functions. (or) What is Substitution Method? Explain Briefly.

Explain Quick Sort Algorithm with Example and Compare the Time Complexity with Radix sort. (or) 10. Explain Heap Sort Algorithm with Example.

11. Explain in detail Representation of Linked List in Memor. (or) 12. What are Hash Tables? Explain with Example. 13. Explain briefly Greedy Algorithm. (or) 14. Explain in detail Aggregate Analysis Technique. 15. (a) What are strongly connected components in Graph? Explain. (b) Explain in detail Minimum Spanning Tree with Example. (or) 16. Explain briefly Dijikstra’s Algorithm to solve the single-source Shortest Paths Problem on weighted directed graph G = (V,E). Here all weights are non negative.

Sign up to vote on this title
UsefulNot useful