[gardhiwasam]

I am preparing for an exam, and this is a question that appears in the textbook:

For a B-tree with the following system parameters:
a. Block size is 4096 bytes
b. Key size is 4 bytes
c. Record size is 128 bytes
d. Pointers for internal branches are 2 bytes

What is L, the maximum number of records each leaf can hold? What is M, the maximum
number of branches in an internal node? If N = 10,000,000 in the worst-case what is the
maximum number of leaf nodes and what is the estimated maximum height of the tree?


I can't figure out what L is. But for M, I did (M-1)4 + 2M >= 4096, for M=684. Is this correct ? And how do I go about estimating maximum height/# of leaves when N= 10,000000