Assignment Chapter $5$

Consider the following set of processes, with the length of the CPU$-$burst times given in milliseconds:

Process Burst Priority Arrival Time

$\backslash$table$[[$P$1,8,4,0],[$P$2,6,1,2],[$P$3,1,2,2],[$P$4,9,2,1],[$P$5,3,3,3]]$

A$.$ Draw six Gantt charts illustrating the execution of these processes using FCFS$,$ SJF pre$-$emptive, SJF Non$-$preemptive, pre$-$emptive priority, Non$-$preemptive priority $($a smaller priority number implies a higher priority$),$ and RR $($quantum $=2)$ scheduling.

a$.$ FCFS

b$.$ pre$-$emptive SJF

c$.$ Non$-$preemptive SJF

d$.$ pre$-$emptive priority

e$.$ Non$-$preemptive priority

f$.RR($quantum $=2)$