Ace Test Series | DBMS | B+ Trees

Question

Consider the following description:

To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record pointer as 7 bytes and search key value as 9 bytes.

What will be the number of data entries possible in level 2 of the B+ tree, if fill factor of the node is 0.8?

1. 17,954
2. 16,954
3. 18,954
4. 19,954

Answer 1

The Option C satisfies but level should be 3, no option matches for level 2. please correct the question.