Open In App

GATE | GATE CS Mock 2018 | Set 2 | Question 46

Like Article
Like
Save
Share
Report

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.

g2017_12

The waiting time (in milliseconds) of process P1 using preemptive priority scheduling algorithm is ____.
(A) 26
(B) 49
(C) 38
(D) 29


Answer: (C)

Explanation: The gantt chart is using preemptive priority scheduling algorithm:
12

Waiting Time = Completion time – Arrival time – Burst Time

Therefore, waiting time of process P1 is = 49 – 0 – 11 = 38

So, option (C) is correct.

Quiz of this Question


Last Updated : 08 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads