GATE | GATE-CS-2007 | Question 85

The order of a leaf node in a tree B+ ? is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
(A) 63
(B) 64
(C) 67
(D) 68

Answer: (A)


  Disk Block size = 1024 bytes
  Data Record Pointer size, r = 7 bytes
  Value size, V = 9 bytes
  Disk Block ptr, P = 6 bytes 

Let order of leaf be m. A leaf node in B+ tree contains at most m record pointers, at most m values, and one disk block pointer.

r*m + V*m + p <= 1024
16m <= 1018
m =< 63

Quiz of this Question

My Personal Notes arrow_drop_up

Recommended Posts:

0 Average Difficulty : 0/5.0
No votes yet.

User Actions