Anonymous user menu

GATE 2016 Session 5 CS Q20

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths
submitted at the same time to a computer system. Which one of the following process
scheduling algorithms would minimize the average waiting time in the ready queue?

       (A)  Shortest remaining time first
       (B)  Round-robin with time quantum less than the shortest CPU burst
       (C)  Uniform random
       (D)  Highest priority first with priority proportional to CPU burst length

Answer

always shortest remaining time first gives minimum waiting time,Turn around time, so

Answer: A

3Comments
Shreyans Dhankhar @shreyans
12 Feb 2016 10:53 pm

A

Mohit Lalwani @monty12
13 Feb 2016 09:34 pm

always shortest remaining time first gives minimum waiting time,Turn around time 

so answer is A)

 

PREETI KAUR @preetikaur
16 Feb 2016 10:43 pm

A.