Question

Process	Burst Time	Priority	Arrival
p1	8	15	0
p2	3	20	0
p3	4	20	20
p4	4	20	25
p5	5	5	45
p6	5	15	55

The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm.

Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 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.

b. What is the turnaround time for each process?

c. What is the waiting time for each process?

d. What is the average waiting time?

Answer 1

Any queries just comment

Give thumbsup

Thank you and all the best