Operating System Theory and Design (Short Job First)

methods. The program does the following: 1. Get the number of processes from the user 2. Get the burst time of each process from the user. 3. Assume that all processes arrive at "O" to the ready queue. 4. The program lets the user select one of the two methods to implement the CPU scheduling. turnaround time. or table. 5. The program calculates the average waiting time and the average 6. The program shows scheduling time of the CPU by using Gant Chart