Question: c) Suppose that five processes (P1, P2, P3, P4, and P5) arrive at time 0 and are ready to be executed. Table Q3 (c) shows

c) Suppose that five processes (P1, P2, P3, P4, and P5) arrive at time 0 and are ready to be executed. Table Q3 (c) shows the burst time of the processes: (i) Describe the operation of each of the following scheduling algorithm. Then apply the algorithms for the processes in Table Q3 (c). Draw the respective Gantt Chart which shows each process's schedule. You must also show the working steps. (I) First-Come, First-Served (FCFS) (II) Shortest-Process-Next (SPN) [2 marks] (III) Highest-Response-Ratio-Next (HRRN) [2 marks] [5 marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
