1. Pertimbangkan satu cakera dengan 2000 silinder, bernombor 0 hingga 1999. Anggapkan kedudukan kepala semasa, berada di silinder 500. Giliran permintaan diberi seperti berikut: 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 a. Lukiskan satu graf bilangan trek lawan masa untuk algoritma penjadualan cakera shortest-service-time-first (SSTF) dan SCAN. Tentukan purata masa 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) b. Antara SSTF dan SCAN, yang mana satukah lebih baik. Berdasarkan maklumat saintifik, jelaskan pendapat anda. Between SSTF and SCAN, which one is better. Based on scientific facts, express your opinion. (CPS7 - 2M)