a program that reads a list of process start times and durations from stdin. That list will be used four times to run through the following CPU scheduling algorithms:

First Come, First Served

Shortest Job First

Shortest Remaining Time First

Round Robin

Your program will show three statistics; the average process response time, the average process wait time, and the average process turnaround time for each scheduling algorithm. The time quantum for the Round Robin scheduler is 100ms. Your program only needs to work with a maximum of 100 processes.

Here is the link for the file that you need to read in https://drive.google.com/file/d/1ZeQFaAIuAGIlJyclft7FHqPQ6cBB5Ipe/view?usp=sharing

Hints:

Don't overcomplicate this assignment. Keep your process start times in one integer array, your burst times in another integer array, and then refer to those processes via other arrays.

Make four functions, one for each scheduling mechanism. Pass the input data to each function as a parameter. Do not modify your original arrays as you will be reusing the data in those arrays multiple times.

This program is simply an adder of process run times to a clock. Use the value of the clock to determine if new processes need to be added to your queue.

Output:

# ./assn3 < processlist.txt First Come, First Served Avg. Resp.:276.40, Avg. T.A.:448.90, Avg. Wait:276.40 Shortest Job First Avg. Resp.:202.90, Avg. T.A.:375.40, Avg. Wait:202.90 Shortest Remaining Time First Avg. Resp.:148.30, Avg. T.A.:353.30, Avg. Wait:180.80 Round Robin with Time Quantum of 100 Avg. Resp.:133.90, Avg. T.A.:555.90, Avg. Wait:383.40