Neco 2018 Data Processing Question 39

Practice objective / multiple choice question 39 from the 2018 Neco Data Processing examination.

Neco 2018 Data Processing Objective / Multiple Choice Medium Difficulty
Question 39 NECO • 2018 • DATA_PROCESSING • objective

A magnetic disk has the following characteristics: average seek time \(8\) ms, rotational latency \(4\) ms, and transfer time per sector \(0.02\) ms. A file occupies 2000 sectors and each disk block holds 10 sectors. Compute the total time required to read the entire file sequentially under each of the following allocation methods, ignoring cache effects: (a) Contiguous allocation. (b) Linked allocation (each block contains a pointer to the next block). (c) Indexed allocation with a single‑level index block. Assume that for linked and indexed allocations each block must be sought separately. Which method yields the fastest read time?

Answer Options

A. Contiguous: 48 ms; Linked: 2600 ms; Indexed: 2500 ms - contiguous allocation is fastest.
Correct Answer B. Contiguous: 52 ms; Linked: 2440 ms; Indexed: 2452.2 ms - contiguous allocation is fastest.
C. Contiguous: 60 ms; Linked: 2400 ms; Indexed: 2420 ms - linked allocation is fastest.
D. Contiguous: 55 ms; Linked: 2500 ms; Indexed: 2600 ms - indexed allocation is fastest.
Correct Answer
B
Correct Option:
Contiguous: 52 ms; Linked: 2440 ms; Indexed: 2452.2 ms - contiguous allocation is fastest.

About This Question

This is Neco 2018 Data Processing Question 39. It is one of the objective questions from the 2018 Neco Data Processing examination.

Difficulty level: Medium .

View More Neco 2018 Data Processing Questions More Neco Practice Questions Back to Questions

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support