Operating Systems Fundamentals $($CS$2342)-$ Assignment $2$

Question $1$: Consider the following set of processes:

The processes are assumed to have arrived in the order $P1,P2,P3,P4,P5,$ all at time $0.$

Draw four Gantt charts that illustrate the execution of these processes using the

following scheduling algorithms: FCFS$,$ SJF$,$ a nonpreemptive priority $($a smaller

priority number implies a higher priority$),$ and RR $($quantum $=1)$

What is the waiting time of each process for each of the scheduling algorithms in part

$1?$

What is the average waiting time of each process for each of the scheduling

algorithms in part $1?$

Which of the schedules in part $1$ results in the minimal average waiting time?

Question$2$: Consider the following table of arrival time and burst time for these processes:

Draw four Gantt charts that illustrate the execution of these processes using the

following scheduling algorithms: FCFS$,$ SJF$,$ a preemptive priority $($a smaller priority

number implies a higher priority$),$ and RR $($quantum $=5).$

What is the waiting time of each process for each of the scheduling algorithms in part

$1?$

What is the average waiting time of each process for each of the scheduling

algorithms in part $1?$