0% found this document useful (0 votes)
14 views1 page

DAA Assignment-2

1. The document is an assignment from the Department of Computer Science & Engineering & Information Technology at United Institute of Technology. It contains short answer and long answer questions about data structures and algorithms. 2. The short answer questions ask about the advantages of RB trees over binary search trees, properties of binomial trees, and properties of B-Trees. 3. The long answer questions ask the student to write algorithms for rotations and insertions in RB trees, insert and delete nodes from an empty RB tree, insert nodes into an initially empty B-tree, extract minimum elements from a binomial heap, explain the union of two binomial heaps with an algorithm, and explain the CONSOLIDATE operation of a Fibonacci heap
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views1 page

DAA Assignment-2

1. The document is an assignment from the Department of Computer Science & Engineering & Information Technology at United Institute of Technology. It contains short answer and long answer questions about data structures and algorithms. 2. The short answer questions ask about the advantages of RB trees over binary search trees, properties of binomial trees, and properties of B-Trees. 3. The long answer questions ask the student to write algorithms for rotations and insertions in RB trees, insert and delete nodes from an empty RB tree, insert nodes into an initially empty B-tree, extract minimum elements from a binomial heap, explain the union of two binomial heaps with an algorithm, and explain the CONSOLIDATE operation of a Fibonacci heap
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

United Institute of Technology (284)

Department of Computer Science & Engineering & Information Technology


Design and Analysis of Algorithm (KCS503)
B. TECH 3rd Year (CSE)

UIT BRANCH-CSE /IT ASSIGNMENT-2 DATE OF


SUBMISSION:
31/10/2023
B.TECH. ODD SEM 2022-23 SEMESTER: 5TH
SUBJECT-DAA SUBJECT CODE-KCS-503 MM.
SECTION –A (SHORT ANSWER TYPE QUESTIONS) CO Blooms
Taxonomy
Level
A What is the advantage of RB tree over binary search tree. CO2 K5

Prove that maximum degree of any node in an n node binomial tree is


B CO2 K6
log n.
1
Prove that if n>=1, then for any n-key B-Tree of height h and
C CO2 K6
minimum degree t >=2, h<= log t ((n +1)/2).

D What are the properties of RB Tree. CO2 K5


SECTION –B (LONG ANSWER TYPE QUESTIONS)

Write the algorithm of Rotation and Insertion of any node in any RB


A CO2 K5
Tree.

Insert the nodes 15, 13, 12, 16, 19,23,5, 8 in empty Red Black Tree
B CO2 K5
and delete in the reverse order of insertion.

Using minimum degree ‘t’ as 3, insert following sequence of integers


10, 25, 20, 35, 30, 55, 40, 45, 50, 55, 60, 75, 70, 65, 80, 85 and 90 in
C CO2 K5
an initially empty B-Tree. Give the number of nodes splitting
2 operations that take place.

Explain the algorithm to extract the minimum elements in a binomial


D CO2 K5
Heap. Give an example for the same.

Explain the different conditions of getting union of two existing


E binomial Heaps. Also write algorithm for union of two Binomial CO2 K5
Heaps. What is its complexity?

What is Fibonacci heap? Explain CONSOLIDATE operation with suitable


F example for Fibonacci heap.
CO2 K6

Prepared by:
Mr. Rohit Mishra

You might also like