Implemented CPU scheduling algorithms :
- FCFS
- SJF
- Priority
- Round robin
1: FCFS
2: Non-Preemptive-SJF
3: Preemptive-SJF
4: Non-Preemptive-Priority
5: Preemptive-Priority
6: Round-Robin
7: Your-Own-Algorithm
8: Compare-All
9: Exit
Input your Choice: [your input]
[If Choice == 1/2/3]
Number of process, n: [your input]
Enter the burst time of P1: [your input]
Enter the arrival time of P1: [your input]
………………………..
………………………..
Enter the burst time of Pn: [your input]
Enter the arrival time of Pn: [your input]
[If Choice == 4/5]
Number of process, n: [your input]
Enter the burst time of P1: [your input]
Enter the arrival time of P1: [your input]
Enter the priority of P1: [your input]
………………………..
………………………..
Enter the burst time of Pn: [your input]
Enter the arrival time of Pn: [your input]
Enter the priority of Pn: [your input]
[If Choice == 6]
Number of process, n: [your input]
Enter the burst time of P1: [your input]
Enter the arrival time of P1: [your input]
………………………..
………………………..
Enter the burst time of Pn: [your input]
Enter the arrival time of Pn: [your input]
Time Quantum: [your input]
[If Choice == 7]
Design the Input/Output according to the requirement of your own algorithm
[If Choice == 8]
Number of process, n: [your input]
Enter the burst time of P1: [your input]
Enter the arrival time of P1: [your input]
Enter the priority of P1: [your input]
Enter anything else needed for P1 according to your own algorithm: [your input]
………………………..
………………………..
Enter the burst time of Pn: [your input]
Enter the arrival time of Pn: [your input]
Enter the priority of Pn: [your input]
Enter anything else needed for Pn according to your own algorithm: [your input]
[If Choice == 9]
Exit the program.
