Hoping to get some assistace for a problem I am having trouble with. Any explanation of how to problem is solved would be appreciated.

Consider the following series of disk requests: 300,330,50,220,450,280,390,420,100,70

Determine the number of cylinders that would be traveled for each of the following Disk Scheduling algorithm assuming the previous request was 219 and the disk head is currently on cylinder 350. Show the results of each traversal from one request to the next. Be sure and show your work so I can see what you have done. For example, if the read head moves from track 300 to 330 be sure and write something like:

300 to 330 = 30

330 to 50 = 280

Then sum the number of traversals. Note that the disk has 500 cylinders (0 through 499). Be sure to show the order of disk reads as indicated above and which disk scheduling scheme results in the lowest number of cylinders traveled. Will this always be the case? Briefly describe how each algorithm works.

Here are the algorithms:

A. FCFS

B. SSTF

C. SCAN

D. C-SCAN

E. C-LOOK