393 views
0 votes
0 votes
consider a B+ tree in which search key is 15B long,block size is 2048B,record pointer size is 12B and block pointer size is 10B long.the maximum no. of keys that can be accomodated in each leaf node of the tree is ___________________??(assume order of leaf node refers to number of keys present in the node)

 

i got 81;

i used this approach-

let no. of keys be x;

15x+ 10(x+1)<= 2048 ;x=81

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
2
Gate Fever asked Nov 7, 2018
303 views
0 votes
0 votes
0 answers
3
Gate Fever asked Nov 7, 2018
323 views
SHOULDN'T THE ANSWER BE 792??
0 votes
0 votes
2 answers
4
Gate Fever asked Nov 7, 2018
271 views