UGC NET CSE | June 2014 | Part 2 | Question: 22

Question

The upper bound and lower bound for the number of leaves in a B-tree of degree $K$ with height $h$ is given by : 

• A. $K^{h}$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$
• B. $K * h$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$
• C. $K^{h}$ and $2 \lfloor \frac{k}{2} \rfloor ^{h-1}$
• D. $K * h$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$

Answer 1

K^h & 2(Ceil k/2)^h-1 

Comments

K is degree or order here ?