Disk requests come to disk driver for cylinders $10, 22, 20, 2, 40, 6$ and…
PYQ GATE 1989
Disk requests come to disk driver for cylinders $10, 22, 20, 2, 40, 6$ and $38$, in that order at a time when the disk drive is reading from cylinder $20$. The seek time is $6$ msec per cylinder. Compute the total seek time if the disk arm scheduling algorithm is
(a) First come first served.
(b) Closest cylinder next.
Sign up free to check your answer
Sign up freeLoading lesson…

