Question

Please answer the following question in C++ language. Thank you. Please answer all the parts.

The following processes are being scheduled using a preemptive, round robin 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.

Thread	Priority	Burst	Arrival
P1	20	30	0
P2	30	20	20
P3	20	10	50
P4	35	25	65
P5	5	5	95
P6	15	10	105

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?

TAT
P1
P2
P3
P4
P5
P6

C) What is the waiting time for each process?

WT
P1
P2
P3
P4
P5
P6

D) What is the CPU utilization rate? Round of to two decimal places.

Answer 1

turnaround time = completion time - arrival time

arrival time= completion time-(arrival time+ burst time)

d. CPU utilization rate= last process arrival time/total completion time =(105/115)*100%= 91.30%

For any further doubt feel free to ask.