Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap Binary Search Tree
Given a fixed‐length record file that is ordered on the key field. The file needs B disk blocks to store R number of records. Find the average access time needed to access any record of the given file using binary search.
1
B / 2
2
B + R
3
B
4
log2 B