Anonymous user menu


Which scheduling policy is most suitable for a time shared operating system?
(a) Shortest Job First
(b) Round Robin
(c) First Come First Serve
(d) Elevator


Answer :-(b)
Exp:-  a round-robin scheduler generally employs time-sharing, giving each job a time slot or quantum (its allowance of CPU time), and interrupting the job if it is not completed by then. It is designed especially for time-sharing systems.

Amit Pal @amitpal101
25 Sep 2016 09:01 pm

Ans (b) . Round Robin is designed in this way to share CPU time among different process equally .