Gate2017 ss Q53

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
P1 0 11 2
P2 5 28 0
P3 12 2 3
P4 2 10 1
P5 9 16 4

The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is ____.

Note – Numerical Type question

Answer
Comment
Array

Option : A
Explanation :
Process AT BT Priority
P1 0 2
P2 5 0
P3 12 3
P4 2 1
P5 9 4

w.t. = 0 + 0 + ( 33 – 5) + (40 – 2) + (49 – 12) + (51 – 9) = 145
Avg wt = 145/5 = 29

Forgot your password?

I agree with the Terms.