Operating Systems

1. Assume that the following processes are the only processes in a computer system and that there are no input/output requests from all the given processes. Given the following arrival time and CPU burst time for each process, answer the following questions. PA Arrival Time o 3 5 CPU Burst Time 10 5 2 PB PC PD Draw the Gantt chart and compute the average waiting time for the following CPU scheduling algorithms. Here the waiting time of a process includes all the time it is in the ready queue. 1) First Come First Served (FCFS). 2) Shortest Remaining Time First (also called Preemptive Shortest Job First). 3) Round-Robin with time quantum of 4 (Assume that new processes will be inserted at the end of the ready queue)