Consider the set of processes with arrival time (in milliseconds). CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time Process Arrival Time Burst Time Priority P 1 0 11 2 P 2 5 28 0 P 3 12 2 3 P 4 2 10 1 P 5 9 16 4 The average waiting time (in milliseconds) of all the processes using pre-emptive priority scheduling algorithm is ______.

GATE Computer Science (CS) 2017 Shift 2 Solved Paper

Question : 61 of 65

Marks: +1, -0

Consider the set of processes with arrival time (in milliseconds). CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time

Process	Arrival Time	Burst Time	Priority
P₁	0	11	2
P₂	5	28	0
P₃	12	2	3
P₄	2	10	1
P₅	9	16	4

The average waiting time (in milliseconds) of all the processes using pre-emptive priority scheduling algorithm is ______.

Your Answer:

Validate

Go to Question:

Prev Question

Next Question