GATE 2006-IT
November 27, 2023UGC NET CS 2009-June-Paper-2
November 27, 2023UGC NET June-2019 CS Paper-2
|
Question 21
|
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
4,34,10,7,19,73,2,15,6,20
Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?
4,34,10,7,19,73,2,15,6,20
Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?
|
357 ms
|
|
|
238 ms
|
|
|
276 ms
|
|
|
119 ms
|
Question 21 Explanation:
Correct Answer: D
Question 21 Explanation: