Design and Analysis of Algorithm Unit 2 Important Questions AKTU

AKTU · BTECH · Semester 5 · Design and Analysis of Algorithm · Unit 2 · Important Question

AKTU Design and Analysis of Algorithm (BCS503) Unit 2 important questions for B.Tech Semester 5 – Advanced Data Structures. Topics: Red-Black Trees…

Open the interactive reader to study this resource on AcademicArk.

Unit 2: Advanced Data Structures – AKTU syllabus topics

Q2e. Explain Fibonacci Heap with suitable example. (7 marks, 2025-26)
Q4b. Explain B-Tree and its properties. Also write B-Tree deletion cases with example. (10 marks, 2023-24)
Q4a. 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, 2024-25)
Q2b. 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, 2024-25)
Q1f. 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, 2025-26)
Q1c. Write short note on Fibonacci Heap. (2 marks, 2023-24)
Q2b. Prove all the four properties of Binomial Tree. (10 marks, 2023-24)
Q4a. Insert the following elements using the property of RB tree. 61,58,51,32,39,29 (10 marks, 2023-24)
Q4b. Explain and write an algorithm for union of two binomial heaps and write its time complexity. (10 marks, 2022-23)
Q4b. What is skip list? Explain the Search operation in Skip list with suitable example also write its algorithm. (10 marks, 2021-22)

AKTU paper codes: BCS503, KCS503, RCS502