Consider the set of process with arrival time (in milliseonds), CPU burst time…
GATE · 2017 · CS · Set 2 · Computer Science & IT
Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority (0 is the highest priority) shown below. None of the process have I/O burst time
The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______
Attempted by 207 students.
Sign up free to check your answer
Sign up freeLoading lesson…