Anna university
B.E / B.tech Degree examination
3rd semester
Department Of Electrical and Electronics Engineering
1. Explain the linked list implementation of list ADT in Detail?
2. Explain the cursor implementation of linked list?
3. Explain the various applications of linked list?
4. Explain the linked list implementation of stack ADT in detail?
5. Explain the array implementation of queue ADT in detail?
6. Explain the different tree traversals with an application?
7. Define binary search tree? Explain the various operations with an example?
8. Define AVL trees? Explain the LL, RR, RL, LR case with an example?
9. Define priority queue? Explain the basic heap operation with anexample?
10. Explain any two techniques to overcome hash collision?
11. Explain the various representation of graph with example in detail?
12. Define topological sort? Explainwith an example?
13. Explain Dijkstra's algorithm with an example?
14.Explain Prim's algorithm with an example?
15. Explain Krushal's algorithm with an example?
16. Explain top-down design in detail?
17. What are the steps taken to improve the efficiency of an algorithm?
19. Design an algorithm fro sine function computation. Explain it with an example?
20. Design an algorithm for reversing the digit of an integer. Explain it with an
example?
21. Design an algorithm for base conversion. Explain it with an example?