Ace Page#39, Q# 20

Question

What is the answer of 2nd Question ??

Answer 1

9. Let p is block pointer ..r is data pointer and k is key...

So internal order of np  + (n-1)*k <= 512B

For leaf node order is : p + n(k+r)<=512B

Putting p= 6B , r=7B , k =9B

By solving above two ..we get ..

n=34 for internal so 0.8 full 27.2=~27

n= 31 for leaf so 0.8 full 24.8 =~ 24

So...

Root level  1node.             27pointers

Level1         27 nodes.       27 * 27 pointers

Level2.         27*27.            27*27*24= 17496

Comments

i guess it should be n-1 instead of n(n comes out to be 32) in leaf node. correct me if i am wrong :)