Assume that you have the following set of five processes tha…
Questions
Assume thаt yоu hаve the fоllоwing set of five processes thаt all arrive at time 0, in the order given below. The length of the CPU burst for each process is given in milliseconds: Process P1: Burst Time = 10 Process P2: Burst Time = 29 Process P3: Burst Time = 3 Process P4: Burst Time = 7 Process P5: Burst Time = 12 Calculate the average waiting time for these processes if they are scheduled using the First-Come, First-Served (FCFS) algorithm. Calculate the average waiting time for these processes if they are scheduled using the nonpreemptive Shortest-Job-First (SJF) algorithm. Calculate the average waiting time for these processes if they are scheduled using the Round-Robin (RR) algorithm with a time quantum of 10 milliseconds.