Question $1($Mandatory$)(50$ points$)$

Question $1$ options:

Consider the following set of processes, with the length of the CPU burst

time given in milliseconds:

Process$$Burst Time$$Priority

P$175$

P$224$

P$3113$

P$491$

P$553$

The processes are assumed to have arrived in the order$$P$1,$P$2,$P$3,$P$4,$P$5,$

all at time $0.$

$$

a$.$ Draw four Gantt charts that illustrate the execution of these

processes using the following scheduling algorithms: FCFS$,$ SJF$,$

nonpreemptive priority $($a smaller priority number implies a higher

priority$),$ and RR $($quantum $=2).$

$$

FCFS: Enter the order of the processes

Enter times for above chart starting with $0$

SJF: Enter the order of the processes

Enter times for above chart starting with $0$

Priority: Enter the order of the processes

Enter times for above chart starting with $0$

Round Robin: Enter the order of the processes

Enter times for above chart starting with $0$

$$

$$

b$.$ What is the turnaround time of each process for each of the

scheduling algorithms in part a$?$

$$

c$.$ What is the waiting time of each process for each of these scheduling

algorithms?

$$

d$.$ Which of the algorithms results in the minimum average waiting

time $($over all processes$)?$

$$

Question $2($Mandatory$)(50$ points$)$

$$

Question $2$ options:

The following processes are being scheduled using a preemptive, roundrobin

scheduling algorithm. Each process is assigned a numerical

priority, with a higher number indicating a higher relative priority.

In addition to the processes listed below, the system also has an idle

task $($which consumes no CPU resources and is identified as$$I$).$ This

task has priority $0$ and is scheduled whenever the system has no other

available processes to run. The length of a time quantum is $5$ units.

If a process is preempted by a higher$-$priority process, the preempted

process is placed at the end of the queue.

$$

a$.$ Show the scheduling order of the processes using a Gantt chart.

$$

Enter the times for the above chart starting with $0$

$$

b$.$ What is the turnaround time for each process?

$$

c$.$ What is the waiting time for each process?

$$

d$.$ What is the CPU utilization rate?

Round of to two decimal places.

$$

$$

Thread

Priority

Burst

Arrival

P$1$

$20$

$30$

$0$

P$2$

$30$

$20$

$20$

P$3$

$20$

$10$

$50$

P$4$

$35$

$25$

$65$

P$5$

$5$

$5$

$95$

P$6$

$15$

$10$

$105$