Q. 42 Consider a disk system with 100 cylinders. The requests to access the cylinders
occur in following sequence :
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is currently at cylinder 50, what is the time taken to
satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and
shortest seek time first policy is used ?
(A) 95 ms
(B) 119 ms
(C) 233 ms
(D) 276 ms
Answer: (B)
Explanation:
