UGC NET CSE | December 2015 | Part 2 | Question: 37

Question

The number of disk pages access in B-tree search, where h is height, n is the number of keys and t is the minimum degree, is

• A. $\theta (\log_n h*t)$
• B. $\theta (\log_t n*h)$
• C. $\theta (\log_h n)$
• D. $\theta (\log_t n)$

Answer 1

The number of disk pages accessed by B-TREE-SEARCH is  Θ(h) =Θ(log_t n), where h is the height of the B-tree and n is the number of keys in the B-tree.

Hence, Option 4 is correct.

Comments

Hi sanjeela, can you explain this a bit more or any one else?