The objective of this assignment is to simulate the Non-Preemptive SJF CPU scheduling algorithms.
Write a program in C++ that simulates the Non-Preemptive SJF CPU scheduling.
Assumption For each program assume that the number of processes is fixed to 3.
Input Each program start by asking the user to enter the arrival time and the CPU burst time for each process, as follows:
Enter arrival time for process P1: Enter CPU burst time for process P1:
and so on for all processes.
Output Each program will then output the waiting time and turnaround time for each process, as well as the average waiting time and the average turnaround time.
I need it to be done within 5 hours