Computer Science, asked by Rishabh8488, 1 year ago

The cpu scheduling algorithm best suited for time sharing os is

Answers

Answered by nirav0309
0

. Which scheduling policy is most suitable for a time-shared operating systems? Explanation: In order to schedule processes fairly, 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

PLZ MARK AS BRAINLEIST

Answered by siddhartha58
0

Which scheduling policy is most suitable for a time-shared operating systems? Explanation: In order to schedule processes fairly, 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.

Similar questions