B+ Tree _ 40q

Question

Calculate the order of B+ tree internal node and leaf node respectively if the disk block size is 512 Bytes. Assume that block pointer, record pointer and key field are of 7B, 8B, and 10B respectively

(A) 30,29

(B) 31,30

(C) 29,28

(D) 32,31

Comments

I am getting $\text{30 and 28}.$
$\text{Internal node}\rightarrow 7P + 10(P-1) \leq 512 \Rightarrow P =30$
$\text{Leaf}\rightarrow Q(8+10) + 7 \leq 512 \Rightarrow Q =28$

---

sorry, @Hemanth_13 sir for so last replying

in the image below that was not the gape... it's just blank...

 

---

For leaf nodes it should be p not p-1 if any change to standard definition it should be specified in the question