Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: Process Arrival time Burst time P1 0 7 P2 3 3 P3 5 5 P4 6 2 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.

GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 34 of 65

Marks: +1, -0

Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:

Process	Arrival time	Burst time
P1	0	7
P2	3	3
P3	5	5
P4	6	2

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.

Your Answer:

Validate

Go to Question:

Prev Question

Next Question