Scribd
Upload
17 views1 page

DAA Notes

Handwritten

Uploaded by

Shivangi
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
17 views1 page

DAA Notes

Handwritten

Uploaded by

Shivangi
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

Sunder Deep Engineering College

NH-9(24), Delhi- Hapur Road, Dasna, Ghaziabad-201015, (U.P.)


Tel: (0120) 2965554

Department: Computer Science and Engineering

Assignment 2

Q1 Write short note on Fibonacci Heap.

Q2 Prove all the four properties of Binomial Tree.

Q3 Insert the following elements using the property of RB tree. 15,13,12,16,19,23,5,8 and delete 8 ,9
and 16.

Q4 Explain B-Tree and its properties. Also write B-Tree deletion cases with example.

Q5 Discuss Skip list and its operations.

Q6 What are the various differences in Binomial and Fibonacci Heap?

Q7 Show that a red-black tree with n internal nodes has height at most 2lg(n+1).

Q8 Explain and write an algorithm for union of two binomial heaps and write its time complexity and
also explain decrease key operation

Q9 insert the keys F,S,Q,KC,L,H,T,V,W,R,N,P,A,B,X,Y,D,Z,E in B Tree with minimum degree t where t is 3.

(hint if t=1 then order is 2t-1)

You might also like