algorithm

Consider the following disk request queue (0-199), with the current head pointer at 101 (it was in location 85 before 101) :

118, 107, 107, 91, 78, 118, 114, 52, 9, 172, 53, 178, 66

Please compute the head movement (i.e. in cylinders) for the following 4 algorithms. For each algorithm, draw an access graph for the above sequence similar to the one in Chapter 9 and compute how many cylinder movements were involved for each algorithm. Which algorithm yield the best result? The algorithms to use are (each 25% of your grade for this assignment):

· FCFS (First Come First Serve)

· SSTF (Shortest Seek Time First)

· SCAN

· C-SCAN