2,038 views
0 votes
0 votes

 

3 Answers

2 votes
2 votes
let order n

n*6+(n-1)*9<=512

n=34 ,Level 3 B+ tree ,so Levels: 0,1,2,3

Root: node=1, key=34-1=33 , child ptr=34

Level1: node=34, key=34*33 , child ptr=34*34

Level2: node=34*34, key=34*34*33 , child ptr=34*34*34

Level3: node=34*34*34, key=34*34*34*33 ,child ptr=0(as leaf node), block ptr=1

since in B+ tree actual entries are stored in leaf nodes hence max entries will be 34*34*34*33 (A)

 

i am getting this...
edited by
0 votes
0 votes
Answer is (34)^3 * 33.

Order of B plus tree ( internal ) = 34.

Level at root is considered as 0.

So, maximum no. of entries = (Order)^3 * (Order -1 ).

Option A.

Related questions

0 votes
0 votes
1 answer
1
iarnav asked Dec 15, 2017
1,362 views
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
0 votes
0 votes
0 answers
2
iarnav asked Dec 15, 2017
190 views
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.
0 votes
0 votes
0 answers
3
iarnav asked Dec 15, 2017
290 views
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.