Section $"$C$"$

Case Analysis

$18.$ Read the case analysis of CPU Scheduling. What is CPU burst? Define best case scenario for CPU scheduling criteria. Find out the CPU arrival time and turnaround time using the algorithm as FCFS$,$ SJF$($preemptive and non$-$preemptive$)$ and Round Robin $)=(1,$ Priority$(1$ be the highest priority$).$

$\backslash$table$[[$Process No$,$Arrival Time,Burst Time,Priority$],[$P$1,0,8,4],[$P$2,2,6,1],[$P$3,2,1,2],[$P$4,1,9,2],[$P$5,3,3,3]]$

Draw the schematic diagram applying the context switching for S$.$JF$($Preemptive$)$ scheduling algorithm of given data.