Anonymous user menu

Shortest Job First Algorithm

plz. Someone explain it ???

1Comment
Dhrupit Dave @dhrupitdave
10 Nov 2014 10:12 am

Answer to this should be Round-robin with quantum of time slice T.

The question itself says that the priority of all processes are re-evaluated after every time slice T. Which defines the round-robin algorithm.

 

The answer seems to you Shortest jo remaining can not be true...since the Shortest remaining job scheduling algorithm do not evaluate the priority for some constant time slice T, it evaluates after addition of any new job.