Group B

2. Define stack. List any four applications of stack. Trace the algorithm to convert infix to postfix for following infix expression $((A+B)-C*D/E)*(H-I)*F+G$ and evaluate the obtained postfix expression with following values: .

3. What are the disadvantages of linear queue? Write an algorithm to insert and remove data items for circular queue with conditions including queue full and empty with an example.

4. What is Doubly linked list? Write an algorithm to add a node at the position of Doubly linked list.

5. What is Tail Recursion? Write an algorithm to TOH with 'n' disks using recursion.

6. What is an AVL tree. Create an AVL tree from the following data: 18, 12, 14, 8, 5, 25, 31, 24, 27.

7. What is heap? Differentiate between min heap and max heap. Sort the following data in ascending order by head method: 2, 9, 2, 12, 15, 8, 11.

8. Explain about Serial and Parallel algorithm with their differences.

Group C

9. What is spanning tree of graph? Explain about adjacency matrix in graph. Find the minimal spanning tree of the following graph using Prim's algorithms.

10. How Collision occurs? What are the techniques used for collision resolution in hashing? Insert the keys: 62, 37, 36, 44, 67, 91, 82, and 31 using quadratic probing method. The hash function is: (where 10 is the table size).

11. Define graph traversal. Explain in brief about BFS and DFS concept. Find the shortest path from source vertex A to other vertices using Dijkstra's algorithm.

Mid-Term Examination Question Set

Mid-Term Examination Question Set