1,118 views
0 votes
0 votes
Which of the Algorithm gives long average waiting time?
(a) SJF (b) Round Robbin (c) FCFS (d) All of the above

2 Answers

1 votes
1 votes

Poor framing of ques ...where did u get ? No scenario is mentioned so difficult to give the correct answer

FCFS can have convoy effect.

SJF has minimum waiting time

RR have better when job lengths vary widely else they can have worse than FCFS when jobs length is same(source: Gavlin)

0 votes
0 votes
process number burst_time
1 2
2 4
3 6
4 2

we can check all the option by taking a randomly example if any option holds true in general then it will hold for all the example.(arrival time=0)

(1) for SJF  AWT=3.5

(2) for FCFS AWT=5

(3) for ROUND ROBIN=5.5(tq=2 unit)

so for round robin AWT is large.

 

Related questions

0 votes
0 votes
1 answer
2
Priyansh Singh asked Sep 16, 2018
1,196 views
In Round Robbin if the Time Quantum is very large then it will behave as:(a) FCFS (b) SJF (c) Priority based (d) None