gatecse
asked
Dec 17, 2017
1,278
views
ISRO-DEC2017-69
Consider a disk sequence with $100$ cylinders. The request to access the cylinder occur in the 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 $2\,ms$ to move from one cylinder to adjacent one and shortest seek time first policy is used? $190$ $238$ $233$ $276$
Consider a disk sequence with $100$ cylinders. The request to access the cylinder occur in the following sequence :$4,34,10,7,19,73,2,15,6,20$Assuming that the head is cu...
