First Assignment
Subject& Code: DAA(BCS-503) Submission date:
30/09/2025
Note: these questions are important in AKTU Examination
B Tree Related Questions:
1. Insert the following information F, S, Q, K, C, L, H, T, V, W, M, R,
N, P, A, B, X, Y, D, Z, E, G, I. Into an empty B-tree with degree
t=3.
2. Insert the following keys in a 2-3-4 B tree. Keys are
40,35,22,90,12,45,58,78,67,60 and then delete key 35 and 22
one after other.
3. Using minimum degree t as 3 insert following sequence of
integers 10, 25,20,35,30,35,40,45,50,55,60,75,70,65,80,85 and
90 in an initially empty B tree. Give the number of nodes splitting
operations that take place.
4. Explain B tree and its properties also write B tree deletion case
with example.
5. Prove that if n>=1, then for any n key B tree of height h and
minimum degree t>=2, h<=logt((n+1)/2).
Red Black Tree Related Questions:
6. What is Red Black Tree? Write an algorithm to insert a node in an
empty Red Black tree. Explain with Suitable Example.
7. Insert the elements 8,20,11,14,9,4,12 in Red Black tree and
Delete 12,4,9,14 respectively.
8. Insert the elements in initially empty R B Tree
12,9,81,76,23,43,65,88,76,32,54 in Red Black tree. Now Delete
23 and 81 respectively.
9. Insert the elements in initially empty R B Tree
15,13,12,16,19,23,5,8 in Red Black tree.
10. Insert the elements in initially empty R B Tree
61,58,51,32,39,29 in Red Black tree.
11. Write an algorithm for insertion of keys in Red Black tree.
Discus the various case of insertion and trace this procedure on
to the following keys 5,16,22,25,2,10,18,30,50,12,1.
Heap Sort Related Questions:
12. Explain heap sort Algorithm. Illustrate this algorithm on to the
following array A=<6,14,3,25,2,10,20,7,6>.
13. How will you sort following array A of elements using Heap
Sort, A=<6,14,3,25,2,10,20,7,6>.
Narendra Kumar Rajput/Department of Computer Science and Engg/KIT Kanpur
Narendra Kumar Rajput| KIT Kanpur/department of Computer science
