The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
54 views
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
asked in Operating System by Boss (5.5k points) | 54 views

1 Answer

+4 votes
Best answer

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. 

answered by Veteran (35.4k points)
selected by
Do we have any particular cpu scheduling algorithm which can minimize the average waiting time?
SJF or SRTF which is your question itself


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,961 questions
37,633 answers
96,402 comments
35,286 users