Skip to content
Related Articles

Related Articles

ISRO | ISRO CS 2013 | Question 26
  • Last Updated : 02 May, 2018

Calculate the order of leaf(pleaf) and non leaf(p) nodes of a B+ tree based on the information given below
Search key field = 12 bytes
Record pointer = 10 bytes
Block pointer = 8 bytes
Block size = 1 KB

(A) pleaf = 51 & p = 46
(B) pleaf= 47 & p = 52
(C) pleaf= 46 & p = 50
(D) pleaf = 52 & p = 47


Answer: (C)

Explanation: In B+ trees the satellite information(record information) is stored in only leaf nodes and not in the non leaf nodes, so no need to include record pointer in the non-leaf nodes.

i) leaf node:
let the order of leaf be 'n'
size of search key field * n + record pointer * n + block pointer <= 1024 
12 * n + 10 * n + 8 <= 1024
22n <= 1016
n = 46

ii) for non-leaf node:
size of search key field * n + block pointer * (n+1) <= 1024
12 * n + 8 * n + 8 = 1024
n = 50.8
order of non-leaf node (p) = 50

Option (C) is correct.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :