Question discussion

A disk block is 1024 bytes, a search key is 8 bytes and a block pointer is 12 bytes. What is the maximum order p (maximum number of pointer…

923Medium DSSSB TGT Computer Science 0 replies

A disk block is 1024 bytes, a search key is 8 bytes and a block pointer is 12 bytes. What is the maximum order p (maximum number of pointers) of an internal node of a B+ tree?

Correct answer: C

Explanation

An internal node holds p pointers and p − 1 keys: 12p + 8(p − 1) ≤ 1024, i.e. 20p ≤ 1032, so p = 51.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!