Scribd
Upload
1 views

Assignment 2

This document outlines an assignment for the Design and Analysis of Algorithms course at ABES Engineering College for the 2024-2025 academic session. It includes a series of questions related to B-Trees, Red-Black Trees, Skip Lists, and Binomial Heaps, each requiring students to demonstrate their understanding and application of algorithm concepts. The assignment is due on November 3, 2024, and consists of various tasks aimed at assessing students' knowledge and problem-solving skills in algorithm design.

Uploaded by

peep8158
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Assignment 2

This document outlines an assignment for the Design and Analysis of Algorithms course at ABES Engineering College for the 2024-2025 academic session. It includes a series of questions related to B-Trees, Red-Black Trees, Skip Lists, and Binomial Heaps, each requiring students to demonstrate their understanding and application of algorithm concepts. The assignment is due on November 3, 2024, and consists of various tasks aimed at assessing students' knowledge and problem-solving skills in algorithm design.

Uploaded by

peep8158
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ABES Engineering College, Ghaziabad

Department of Computer Science and Engineering

Session: 2024-2025 Semester: V Section: A, B, C


Course Code: BCS-503 Course Name: Design and Analysis of Algorithms
Assignment 2
Date of Assignment: 10-10-2024 Date of submission:03-11-2024

S.No. KL, CO Question Marks

K3, CO2 (i) Show the results of inserting the keys F, S, Q, K, C, L, H, T, V, W, M, 2


R, N, P, A, B, X, Y, D, Z, E in order into an empty B-Tree. Use t=3,
1 where t is the minimum degree of B-Tree.
(ii) Create B-tree of order 5 from the following lists of data items: 20, 30,
35, 85, 10, 55, 60, 25, 5, 65, 70, 75, 15, 40, 50, 80, 45.
K3, CO2 (i) Discuss all the cases in RB-Insert-Fixup Algorithm. Show the steps 2
for creating RB Tree by successively inserting the keys
2
10,12,15,8,7.

(ii) Show that a Red-Black tree with n internal nodes has height at most
2lg(n+1)
K3, CO2 (i) Discuss all cases of deletion in RB-tree. Discuss the time 2
complexity of deletion operations in RB-tree.
3 (ii) What is skip list? Explain the Search operation in Skip list with
suitable example also write its algorithm.

K3, CO2 (i) Explain and write an algorithm for union of two binomial heaps and 2
write its time complexity.
(ii) Shows various cases in Union operation on following Binomial
heap.

(iii) Write down the algorithm for Decrease key operation in Binomial
Heap also write its time complexity.
K3, CO2 (i) Discuss Fibonacci Heap. Differentiate Binomial Heap and Fibonacci 2
5 Heap.
(ii) Explain and write Extract Minimum algorithm of Fibonacci Heap

KL- Bloom’s Knowledge Level (K1,K2,K3,K4,K5,K6)


K1 – RememberK2 – UnderstandK3 – ApplyK4 – AnalyzeK5 – EvaluateK6– Create

You might also like