Imagine we have a disk drive with 3000 cylinders, which are numbered 0 to 2999. The drive is currently serving a request at cylinder 93, and the previous request was at cylinder 125 (hint this tells you direction). The queue of pending requests, in FIFO order, is: 45, 1950, 912, 1090, 130, 10, 2250, 130
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 disk scheduling algorithms feel free to draw how the head navigated through each of the algorithm and count that way, or create a table showing each head movement to keep track.
FCFS
SCAN
SSTF
C-SCAN
Q2: After looking over your results for question 1, which algorithm causes the disk head to travel the smallest number of cylinders?