a) Explain the insertion operation in linked list. How nodes are inserted after a specified node? (Unit 1)

b) What are the drawbacks of single linked list? Write and explain the algorithm for search and modify operations in doubly linked list with example. (Unit 1)

a) What are the limitations of queue? Explain the algorithms for various operations of circular queue. (Unit 2)

b) Explain the array implementation of stack ADT in detail. (Unit 2)

a) Explain an algorithm to check whether the parentheses in an expression are balanced using a stack. (Unit 2)

b) How to insert and delete an element into a binary search tree and write down the code for the insertion. (Unit 3)

Construct an expression tree for the expression $(a + b * c) + ((d * e + f) * g)$. Give the outputs when you apply in order preorder and post order traversals. (Unit 3)

a) Compare Prim's algorithm with Kruskal's algorithm for finding minimum spanning trees. (Unit 4)

b) Explain Breadth First Search algorithm with example. (Unit 4)

a) Create a binary search tree for the following numbers start from an empty binary search tree. 45, 26, 10, 60, 70, 30, 40 Delete keys 10, 60 and 45 one after the other and show the trees at each step. (Unit 3)

b) Provide examples of real-world applications where hashing is used and explain any two example in details. (Unit 5)

a) Explain how to sort the elements by using selection sort and derive time complexity for the same. (Unit 5)

b) Illustrate with examples the operations of insertion and deletion in an AVL tree. (Unit 3)

Write a short notes (any three)

i) Merge Sort (Unit 5)

ii) Graph (Unit 4)

iii) B+ Tree (Unit 3)

iv) Dqueue (Unit 2)