Anna University, Chennai
Department of Computer Science and Engineering
CS2201 Data Structures Important Questions
1. Explain the different types of linked lists and its implementation
2. Describe circular queue implementation in detail giving all the relevant features
3. Write an algorirhm for pre-order and postorder traversal of a binary tree
4. . Explain in detail about binary heap and construct a min heap tree for the elements 7,3,8,7,2,3,6,9,4
5. Explain in detail about ADT binary search tree
6. What are the different operations that can be performed in a queue? Explain in detail
7. Explain the three standard ways of traversing a binary tree T with a recursive algorithm
8. Explain the tree traversals. Give all the essential aspects
9. Explain the operations which are done in B- Tree with examples
10.What is heap order property? Explain the operations which can be done in heap with examples
11.Derive an ADT to perform insertion and deletion in a singly linked list
12. Explain topological sort with an example
13. Briefly explain the three common collision resolution strategies in open addressing hashing
14. Explain BFS with an example
15. Write about the different types of hashing techniques in detail
16.Explain the Dijkstra’s single source shortest path algorithm with an example
17. Explain the prim’s algorithm with an example
18. What are AVL trees? Describe the different rotations defined for AVL tree. Insert
the following elements step by step in sequence into an empty AVL tree 18, 19, 22, 20, 29, 32, 24
19. Explain about disjoint sets and its operation in detail