Which scheduling algorithm has shortest turn-around time?a) shortest job firstb) Round-Robinc) Preemptive-priority

Questions by suji   answers by suji

Showing Answers 1 - 29 of 29 Answers

r.b.gaikwad

  • Nov 20th, 2005
 

easy , one & best option ... round robin algo.

Priyank Vaish

  • Mar 22nd, 2006
 

Hi everyone

Ans is Shortest Job first.

  Was this answer useful?  Yes

Badri1987

  • Mar 15th, 2009
 

Preemptive priority because shortest job first initializes schedule and goes according to that and round robin definitely not because higher priority process does not finish quickly

  Was this answer useful?  Yes

kannugo

  • Aug 12th, 2010
 

Shortest job first is theoretically the fastest algorithm, but in real world round robin is the best scheduling algorithm. Preemptive priority is a bit faster but it is also a bit costly to maintain few register for storing the information about unfinished processes.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions