The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

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

  1. $\theta (\log_n h*t)$
  2. $\theta (\log_t n*h)$
  3. $\theta (\log_h n)$
  4. $\theta (\log_t n)$
asked in Algorithms by Veteran (96.2k points)
recategorized by | 1.2k views

1 Answer

+2 votes

The number of disk pages accessed by B-TREE-SEARCH is  Θ(h) =Θ(logt 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.

answered by (187 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,587 questions
54,197 answers
71,151 users