1,158 views
1 votes
1 votes
There are six processes waiting in ready queue with the burst time are 9 ,  7 , 4 , 2 , 1 and x . In what order should they run to minimize the average waiting time when the value of x is either 5 or 6.

a) 1 , 2 , 4 , x , 7 , 9

b) 9 , 7 , x , 4 , 2 , 1

c) x , 7 , 9 , 4 , 2 , 1

d) order cannot be decided

1 Answer

Best answer
5 votes
5 votes

We get the best average waiting time for the sequence, in which we process the request in increasing order of burst time. 

Hence Option a) 1,2,4,x,7,9 will give the desired result. 

selected by

Related questions

0 votes
0 votes
1 answer
2
Nam14 asked Apr 5, 2023
514 views
Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...
0 votes
0 votes
3 answers
3
Chaitanya Kale asked Sep 22, 2022
632 views
If we are using non-preemptive CPU scheduling then can there be process state transition from running to ready state?
1 votes
1 votes
1 answer
4
iarnav asked Jan 12, 2022
386 views
Does non preemptive CPU scheduling needs hardware support.kindly explain.