Design and Analysis of Algorithm Unit 2 – Advanced Data Structures: important questions for AKTU
Unit 2 (Advanced Data Structures) questions that AKTU repeats most often. This unit carries about 27 marks per paper. Start with the repeated questions, then the most asked topics.
Most repeated Unit 2 questions
- Explain Fibonacci Heap with suitable example. (7 marks, 2026, Fibonacci Heaps) – also asked in 2025, 2023, 2022, 2021
- Insert the following string in the initially empty tries: DOG, DONE, CAT, CAN, RIGHT, DO, JUG, DAA, CA, CAME. Also make a compress tries of it. (7 marks, 2025, Tries) – also asked in 2024, 2021, 2020
- Define Binomial Heap. Write an algorithm for union of two binomial heaps. Also take a suitable example which clearly illustrates merging operation of two binomial heaps. (7 marks, 2025, Binomial Heaps) – also asked in 2024, 2023, 2022
Most important Unit 2 topic
- Binomial Heaps (Unit 2: Advanced Data Structures) – asked 11 times in 2019, 2020, 2021, 2022, 2023, 2024, 2025
Most asked Unit 2 topics
- Binomial Heaps – asked 11 times
- Red-Black Trees – asked 8 times
- B-Trees – asked 4 times
More Unit 2 previous year questions
- What is a Persistent Data Structure? (2 marks, 2026, Persistent Data Structures)
- In a Red-Black Tree, how many black nodes are there on any path from the root to the leaf if the black height is 3? (2 marks, 2026, Red-Black Trees)
- In a Skip List, if the probability of a node being promoted to the next level is 1/2, what is the expected number of nodes at the second level if there are 100 nodes at the base level? (7 marks, 2026, Skip List)
- List the properties of Binomial Heap (2 marks, 2025, Binomial Heaps)
- Design a Binomial Heap for the following A. A= {7, 2, 4, 17, 1, 11, 6, 8, 15, 10, 20} (7 marks, 2025, Binomial Heaps)
Unit 2 syllabus topics
- Red-Black Trees
- B-Trees
- Binary Search Trees
- Binomial Heaps
- Fibonacci Heaps
- Tries
- Skip List
- Persistent Data Structures