Question: ( 2 0 points ) Suppose that a disk drive has 5 0 0 0 cylinders, numbered 0 to 4 9 9 9 . The
points
Suppose that a disk drive has cylinders, numbered to The drive is currently serving a rquest at cylinder
and the previous request was at cylinder The queue of pending requests, in FIFO order is
Starting from the current head position, what is the total distance in cylinders that the disk arm moves to satisfy all the
pending requests, for each of the following diskscheduling algorithms.
a FCFS
b SSTF
c SCAN
d CSCAN
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
