Consider one disk with 2000 cylinders, numbered 0 to 1 999. Assume the current position of...

Transcribed Image Text:

Consider one disk with 2000 cylinders, numbered 0 to 1 999. Assume the current position of head is at cylinder 500. The request queue is given as follows: 103, 80, 1400, 813, 1714, 748, 1500, 1100 pencarian. Draw a graph track number versus time for shortest-service-time-first (SSTF) and SCAN disk scheduling algorithm. Determine its average seek length. (CPS7 - 10M) Between SSTF and SCAN, which one is better. Based on scientific facts, express your opinion. (CPS7 - 2M) Consider one disk with 2000 cylinders, numbered 0 to 1 999. Assume the current position of head is at cylinder 500. The request queue is given as follows: 103, 80, 1400, 813, 1714, 748, 1500, 1100 pencarian. Draw a graph track number versus time for shortest-service-time-first (SSTF) and SCAN disk scheduling algorithm. Determine its average seek length. (CPS7 - 10M) Between SSTF and SCAN, which one is better. Based on scientific facts, express your opinion. (CPS7 - 2M)