5. Suppose that the following processes arrive for execution at the time indicated in the following table. Each of the proces 5. Suppose that the following processes arrive for execution at the time indicated in the following table. Each of the process will run for the amount of time listed. In answering the questions, use First Come First Served FCFS) Shortest Remaining Time First SRTF), and Round Robin (RR) (with time quantum =2) Process Arrival Time Burst Time Draw Gantt charts • Compute the average turnaround time and the average waiting time for each case. Dec 17 3o



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *