1. Shortest remaining time first
  2. Round – robin with time quantum less than the shortest CPU burst
  3. Uniform random
  4. Highest priority first with priority proportional to CPU burst length
4 views

1 Answers

Option 1 : Shortest remaining time first

As all the processes are arriving at the using shortest remaining time first algorithm, we can decrease the number of processes in the queue as soon as possible thus total waiting time will decrease and so will average.
4 views

Related Questions