Q which of the following scheduling policy is well suited for a time-shared operating system ? 1 shortest job first 2 round robin 3 first come=first served 4 elevator

Questions by Rujul   answers by Rujul

Showing Answers 1 - 12 of 12 Answers

Jit

  • Feb 28th, 2007
 

Round Robin

  Was this answer useful?  Yes

thukral.rahul

  • Jan 12th, 2010
 

In a time sharing system, the main concern is to reduce the response time so that the user is given an abstraction that whole of the processor is dedicated to the user process even though multiple process are running.

So to achived this Round Robin CPU Scheduling is used and genearally the time quantum of RR should be between 10 milisec to 100 milisec

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