Question

Please answer the following question in C++ language

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

time given in milliseconds:

Process            Burst Time      Priority

P1. 7 5

P2 2 4

P3 11 3

P4 9 1

P5 5 3

The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, 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 the times for the above chart starting with 0

Priority: Enter the order of the processes

Enter the times for the above chart starting with 0

Round Robin: Enter the order of the processes

Enter the times for the above chart starting with 0

b. What is the turnaround time of each process for each of the scheduling algorithms in part a?

x	FCFS	SJF	PRI	RR
P1
P2
P3
P4
P5

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

X	FCFS	SJF	PRI	RR
P1
P2
P3
P4
P5

d. Which of the algorithms results in the minimum average waiting time (over all processes)?

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?

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.

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

Answer 1

Since the gantt chat can't be typed here so I have attached handwritten notes