Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:ProcessArrival timeBurst timeP107P233P355P462If 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 CS 2017 Set 2 – Question 51

Numerical answer 2 marks Question 51 2017

Question 51

NAT 2 marks · no negative Operating Systems

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

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2017 Operating Systems

Source: GATE 2017 Computer Science and Information Technology, Set 2 (question number approximate)

GATE CS 2018 – Question 20
GATE CS 2016 Set 1 – Question 49
GATE CS 2014 Set 2 – Question 40
GATE CS 2014 Set 1 – Question 32
GATE CS 2013 – Question 44
GATE CS 2012 – Question 28
GATE CS 2011 – Question 15
GATE CS 2006 – Question 62

All Operating Systems questions

The answer and the full explanation are one sign-in away

Where this question comes from

More questions from Operating Systems