Consider a disk with n cylinders numbered sequentially 0, 1, 2,., n-1. The unit has just finished servicing requests on cylinder 152 and has moved to cylinder 163. The queue of requests to be serviced is as follows:

163, 89, 137, 913, 1224, 1248, 1119, 1522, 1653, 139

Where 163 is the oldest request and 139 is the latest arrival.

a) In what order will the cylinders be serviced under the following scheduling policies?

FIFO_________________________________________________________

SSTF_________________________________________________________

SCAN________________________________________________________

b) What will be the distance (number of cylinders) traveled by the R/W head under each policy?

FIFO______________

SSTF______________

SCAN_____________