B-Trees

Question 1
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
θ(log​ n​ h*t)
B
θ(log​ t​ n*h)
C
θ(log​ h​ n)
D
θ(log​ t​ n)
       Data-Structures       B-Trees       UGC NET CS 2015 Dec- paper-2
Question 1 Explanation: 
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 θ(log​ t​ n).
Note: B-Tree search operation best,average and worst case will take θ(logn).
There is 1 question to complete.
PHP Code Snippets Powered By : XYZScripts.com