3 votes 3 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 $\theta (\log_n h*t)$ $\theta (\log_t n*h)$ $\theta (\log_h n)$ $\theta (\log_t n)$ Algorithms ugcnetcse-dec2015-paper2 algorithms tree + – go_editor asked Aug 8, 2016 recategorized Nov 9, 2017 by Devshree Dubey go_editor 3.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 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. sanjeela.sagar answered Feb 10, 2017 sanjeela.sagar comment Share Follow See 1 comment See all 1 1 comment reply sristicse commented Apr 20, 2020 reply Follow Share Hi sanjeela, can you explain this a bit more or any one else? 0 votes 0 votes Please log in or register to add a comment.