Neco 2023 Data Processing Question 37
Practice objective / multiple choice question 37 from the 2023 Neco Data Processing examination.
A file contains \(10\,000\) records each of size \(80\) bytes. The disk block size is \(512\) bytes.\n\n(a) For sequential file organization, assuming records are stored consecutively in blocks, compute the average number of block accesses required to retrieve a randomly selected record.\n\n(b) For indexed file organization, an index entry occupies \(12\) bytes and the entire index fits in one block. Compute the average number of block accesses required to retrieve a randomly selected record.\n\nWhich organization requires fewer block accesses on average?
Answer Options
About This Question
This is Neco 2023 Data Processing Question 37. It is one of the objective questions from the 2023 Neco Data Processing examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.