Compare the algorithms and determine which is the fairest for the next process in the queue. Explain why this algorithm will always be the fairest disk-scheduling algorithm.
Prior to beginning work on this assignment, read the following sections in your textbook: 9.1 to 9.6 and 9.9 in Chapter 9: Mass-Storage Structure. Finally, read the Operating System Scheduling Algorithms tutorial (Links to an external site.). Part 1: To complete this assignment, consider the following scenario: A disk drive has 300 cylinders, numbered 0 … Read more