Data Structures & Algorithms
Important Questions in Data Structures & Algorithms 142301
ANNA UNIVERSITY OF TECHNOLOGY EXAMINATIONS FOR SECOND YEAR THIRD SEMESTER IT Students
UNIT I
1. What is Stack? Give the implementations of stack and explain clearly the data structure and
routines used.
2. What is singly linked list? Explain the algorithm in detail about various operations performed on a node from a Singly Linked list
3. Illustrate with a neat example the implementation of a circular queue
UNIT II
1. With an example explain the algorithms of inorder and postorder traversals on a binary search
2. Explain the binary heap in detail.
3. Explain the rotations operations which are done in AVL-Tree. Construct the AVL Tree for the
following 18,26,9,47,54,32,12,58,30,60,44,74,33,55
4. Explain the tree traversals in detail
UNIT III
Discuss in detail open addressing and rehashing
2. Explain in detail the collision resolution methods.
3. What is meant by collision in hashing? Explain the separate chaining collision resolution strategy.
4. Explain in detail about Extensible hashing
UNIT IV
1. Explain in detail about DIjkstra’s Algorithm with an example
2. Explain in detail about DFS and BFS Techniques with an example
3. Explain the prim’s and Kruskal’s Algorithm with an example
UNIT V
1. Explain in detail about Divide and conquer Algorithm with an example.
2. Explain in detail about Dynamic Programming with an example
3. Explain in detail about Greedy Algorithm with an example
4. Explain in detail about Backtracking Algorithm with an example
