Question

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.

Process            Burst Time Arrival Time Priority

P1 15 0 8

P2 20 0 3

P3 20 20 4

P4 20 25 4

P5 5 45 5

P6 15 55 5

1- What is the average turnaround time of these processes?

2- What is the average waiting time of these processes?

Answer 1