Computer Science · Database Management Systems
The total cost of retrieving records in sorted order using an unclustered B+ tree is approximately given by which of the following? (where P is the average number of records per data page, N is the number of data pages, and F is the ratio of the size of a data entry to the size of a data record)
- 1(F * N) + P
- 2(F + P) * N✓
- 3F * N * P
- 4F + P / N
Correct answer
(F + P) * N
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems