Question

Consider the set of processes shown in the table above, with the length of the CPU-burst time given in milliseconds. The processes are assumed to have arrived in the order P5, P4, P3, P2 , and P1, all approximately at time 0. Draw three Gantt charts illustrating the execution of these processes using SJF, Round-Robin (quantum size = 3), and a non-preemptive priority (a smaller priority number implies a higher priority) scheduling. Calculate average waiting time of each scheduling. Calculate average turnaround time of each scheduling.

Process	Burst Time	Priority
P1	8	3
P2	4	1
P3	2	5
P4	3	4
P5	5	2

Answer 1

please give a like