943 views
1 votes
1 votes

2 Answers

0 votes
0 votes
4 Levels ?
0 votes
0 votes

It is a B+ tree. So at leaf level, there will only be record pointers. Assuming that there are 11 record pointers per block in leaf level, we will have 11*x = 1250, x = cel(113.64) = 114 blocks

It is given that there are 3 records per block, therefore number of blocks in leaf level  = ceil(1250/3) = 417

To index these 417 blocks, we need ceil(417/11) = 40 blocks (Since there are 11 pointers per block)

Again, in next level we need ceil(40/11) = 4 blocks

Again, for those 4 blocks, we need 1 blocks.

Hence, a total of 4 levels.


 

edited by

Related questions

2 votes
2 votes
1 answer
1
skywalker_19 asked Oct 8, 2018
653 views
How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree
1 votes
1 votes
1 answer
2
Arnabi asked Oct 28, 2017
785 views
Given a data file with 100 records per page and 1000 pages and on indexpage capacity of 512 index entries, how deep should be the B+ tree toindex this file.please explain...
2 votes
2 votes
2 answers
4
Arnabi asked Oct 25, 2017
633 views