Question

QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1 C 6 * Lower number means higher priority Burst Time (ms) 5 3 4 Draw in a paper sheet 4 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Non-Preemptive SJF, Shortest-Remaining-Time-First (SRTF), Non-Preemptive Priority (NPP), and RR (quantum time = 2) scheduling algorithms, then fill the following tabic accordingly. (Note: If a new process arrives at the same time that a process finishes using the CPU, then the new process will be added to the ready queue first.) Input only the final value in each blank, DO NOT add extra space or characters before or after the value. D А End Start End Start End Start End Start FCFS SJF SRTF NPP RR

Answer 1

Perosity Process Arrival Time Buerst Time 3 А A 2 3 1 1 3 с. 2 6. 3 Soleth FCFS Tol B В 15 5 SJ С A B D o 5 8 15 SRT D A A B В 8 15 4 NPP AllB 5 8 9 15 RR CABIDC ALBTC CA DeAD 8 9 11 13 14 15 0 2 4 6