Neco 2025 Data Processing Question 30
Practice objective / multiple choice question 30 from the 2025 Neco Data Processing examination.
A file stores records of size \(200\) bytes. The disk has a block size of \(4096\) bytes, an average seek time of \(5\) ms, a rotational latency of \(4\) ms and a transfer rate of \(80\) MB/s.\n\n(a) Compute the average time to read a random record when the file uses a sequential file organization.\n(b) The same file is reorganised as an indexed‑sequential file. The index block contains \(64\) entries, each \(8\) bytes. Assuming the index block must be read from disk, compute the average time to read a random record.\n\n(c) Which organization gives the lower access time and what is that time (in ms)?
Answer Options
About This Question
This is Neco 2025 Data Processing Question 30. It is one of the objective questions from the 2025 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.