Data Structures Unit 2 – Stacks, Recursion & Queues: important questions for AKTU
Unit 2 (Stacks, Recursion & Queues) questions that AKTU repeats most often. This unit carries about 30 marks per paper. Start with the repeated questions, then the most asked topics.
Most repeated Unit 2 questions
- Write algorithm for Push and Pop operations in stack. Transform the following expression into its equivalent postfix expression using stack: A + (B * C - (D / E ↑ F) * G) * H (10 marks, 2020, Stacks) – also asked in 2024, 2025, 2026, 2023
- Write an algorithm for converting infix expression into postfix expression. Trace your algorithm for infix expression Q into its equivalent postfix expression P, Q: A + ( B * C – ( D / E ^ F) * G ) * H (7 marks, 2026, Stacks) – also asked in 2024, 2020
- Write an algorithm to convert a valid arithmetic infix expression into an equivalent postfix expression. Trace your algorithm for following infix expression. A+B*C-D/F (7 marks, 2024, Stacks) – also asked in 2020, 2026
Most important Unit 2 topic
- Stacks (Unit 2: Stacks, Recursion & Queues) – asked 20 times in 2020, 2021, 2022, 2023, 2024, 2025, 2026
Most asked Unit 2 topics
- Stacks – asked 20 times
- Recursion – asked 9 times
- Queues – asked 8 times
More Unit 2 previous year questions
- What is the difference between array implementation and linked list implementation? (2 marks, 2026, Stacks)
- What do you understand by polish notion? (2 marks, 2026, Stacks)
- Write the difference between stack and Queue in Data Structure. (2 marks, 2026, Stacks)
- What do you mean by recursion? Discuss advantages and disadvantages of recursion. (2 marks, 2026, Recursion)
- Write an algorithm for finding a solution to the Tower of Hanoi problem. Explain the working of your algorithm (with 4 disks) with diagrams. (7 marks, 2026, Recursion)
Unit 2 syllabus topics
- Stacks
- Recursion
- Queues