Question

Write a program to implement various CPU scheduling algorithms. The input and output are described below. Input 1. The first line of the input represents the scheduling algorithm a. 1 for FCFS b. 2 for shortest-job first c. 3 for shortest remaining time first d. 4 for priority scheduling e. 5 for round-robin scheduling 2. The second line of the input represents the number of processes 3. The third line of the input contains the arrival time of the processes 4. The fourth line represents the CPU burst times of the processes 5. In the case of priority scheduling, the fifth line represents the priority of each process. Lesser the priority value, the higher the priority of the process 6. In the case of round-robin scheduling, the fifth line contains the time quantum. Output 1. The first line of the output should be the waiting times of the processes separated by space. 2. The second line of the output should be the response times of the processes separated by space. 3. The third line of the output should be the turnaround times of the processes separated by space. 4. The fourth line of the output should be the throughput. Turn-in: You are asked to electronically turn in your source files (or a shell script). Attach a README file describing the names of your executables, the compiling instructions, or anything else special you want to let us know. The README file should be in plain text format. Instructions for electronic turn-in will be conveyed to you a few days before the deadline.

Write a program to implement various CPU scheduling algorithms. The input and output are described below.
Input
1. The first line of the input represents the scheduling algorithm
a. 1 for FCFS
b. 2 for shortest-job first
c. 3 for shortest remaining time first
d. 4 for priority scheduling
e. 5 for round-robin scheduling
2. The second line of the input represents the number of processes
3. The third line of the input contains the arrival time of the processes
4. The fourth line represents the CPU burst times of the processes
5. In the case of priority scheduling, the fifth line represents the priority of each process. Lesser the priority value, the higher the priority of the process
6. In the case of round-robin scheduling, the fifth line contains the time quantum.
Output
1. The first line of the output should be the waiting times of the processes separated by space.
2. The second line of the output should be the response times of the processes separated by space.
3. The third line of the output should be the turnaround times of the processes separated by space.
4. The fourth line of the output should be the throughput.
Turn-in:
You are asked to electronically turn in your source files (or a shell script). Attach a README file describing the names of your executables, the compiling instructions, or anything else special you want to let us know. The README file should be in plain text format. Instructions for electronic turn-in will be conveyed to you a few days before the deadline.

Added by Encarnacion G.

Question

Please give Ace some feedback