Neco 2017 Data Processing Question 47
Practice objective / multiple choice question 47 from the 2017 Neco Data Processing examination.
A file of size \(2.4\text{ MB}\) is stored on a disk whose block size is \(4\text{ KB}\). The disk requires \(5\) ms to read a block. Three file‑allocation methods are considered:\n\n1. Contiguous allocation.\n2. Linked allocation, where each block read incurs an additional \(0.5\) ms pointer‑traversal overhead.\n3. Single‑level indexed allocation, where each data‑block access first reads the index block (\(5\) ms) and then the data block (\(5\) ms). The index block is read for every access.\n\nDetermine which allocation method results in the minimum total time to read the entire file sequentially.
Answer Options
About This Question
This is Neco 2017 Data Processing Question 47. It is one of the objective questions from the 2017 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.