Computer Science · File Structures
Given a fixed-length record file ordered on its key field, where the file requires B disk blocks to store R records. What is the average number of block accesses needed to search for a record using binary search?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1log2 B✓
- 2B
- 3B + R
- 4B / 2
Correct answer
log2 B
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice File Structures MCQs →Want more practice questions on File Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · File Structures