Design and write a Monte Carlo simulation written in C/C++ of the four disk scheduling algorithms shown in Figure 11.7 using uniform random numbers. Seek time is to be measured in number of tracks crossed.
Simulation parameters: 1) Number of I/O requests (25-75), 2) Track of each I/O request (1-199) without duplicates within a simulation.
Run at least 100 simulations for each Number of I/O requests. Calculate the average over all simulations of the average seek lengths for each algorithm.
Using an application such as Excel. plot the average seek length of each algorithm for each simulation on the same chart. The chart should start with the smallest Number of I/O requests.
Submit your code and report. Your chart needs to be included and discussed in your report.
The four disk scheduling algorithms are: FCFS, SSTF, SCAN, and C-SCAN.