DSA Model Question 1
Published by: Anil K. Panta
Data Structure and Algorithm (DSA)-Model Question
Short Question[2x10=20]
1. Define Abstract Data Type (ADT).2. Define the principle of recursion.
3. Write the algorithm steps for the PUSH operation.
4. What is the purpose of the front and rear pointers in a queue?
5. List basic operations performed on a linked list.
6. Define the term "height" of a tree.
7. Differenciate between internal and external sorting.
8. Define Binary Search.
9. Differentiate between DFS and BFS.
10. Why Big 0 is mostly used?
Descriptive Question any five [5x10=50]
11. Explain the various asymptotic notations used in algorithm analysis with diagram.12. Discuss the advantages and disadvantages of recursion over iteration. Write a program to implement Tower of Hanoi for n number of disks using c programming.
13. Explain the queue data structure with its operations and terminology. Write a program to implement enqueue and dequeue in a circular queue.
14. What is a Linked list? Explain different types of linked lists with diagrams.
15. Find the minimum spanning tree of a given graph by using Kruskal’s Algorithm.
Analytical Question any Two[2x15=30]
16. Explain infix, postfix, and prefix expressions with examples. Write an algorithm for converting an Infix expression to Postfix expression. Convert the following expression into Postfix showing content of the stack at each step. K + L – M * N * I + (O ^ P) * W / U – V * T + A17. What is sorting in DSA? Explain any 4 types of sorting algorithm with examples. Trace and sort the following data using the insertion sorting algorithm. 90, 56, 80, 10, 22, 21, 45, 9
18. Explain all four rotations used in AVL trees with examples. Also, construct a AVL tree for the following sequence of keys:
50, 20, 60, 10, 8, 15, 32, 46, 11, 48
and perform the following:
a. Show the AVL after all insertions
b. Delete the node with value 20 and show the updated BST
c. Write inorder, preorder, and postorder traversals of the final tree
