## B-Trees

Please wait while the activity loads.

If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

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:

θ(log _{n} h*t) | |

θ(log _{t} n*h) | |

θ(log _{h} n) | |

θ(log _{t} n) |

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

Note: B-Tree search operation best,average and worst case will take θ(logn).

_{t} n).Note: B-Tree search operation best,average and worst case will take θ(logn).

There is 1 question to complete.