UGC NET Dec 2004 paper-1
October 11, 2023Operating-Systems
October 11, 2023Process-Scheduling
|
Question 19
|
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:

If the pre-emptive shortest remaining time first scheduling algorithm is used to schedule the processes, then the average waiting time across all processes is __________ milliseconds.
|
3
|
|
|
4
|
|
|
5
|
|
|
6
|
Question 19 Explanation:

Correct Answer: A
Question 19 Explanation:

