Chapter $5$ : CPU Scheduling

Submission due date: April ${20}^{th},2024.$

Suppose that processes P$1,$ P$2,..,$P$5$ arrive for execution at the times indicated in

Table $1.$ Each process will run for the amount of time listed and will be assigned a

priority ranging from $0($highest$)$ to $10($lowest$).$ No more processes will arrive until

the last process is complete. In answering the questions, base all decisions on the

information you have at the time the decision must be made.

Table $1$: Process arrival$/$CPU$-$burst times and priorities.

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

following scheduling algorithms:

a$.$ FCFS;

b$.$ preemptive SJF;

c$.$ preemptive priority $($SJF if priority is equal$)$;

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

What is the turnaround time of each process for each of these four scheduling

algorithms?

What is the waiting time of each process for each of these four scheduling

algorithms?