'Operating System | Round-robin scheduling MCQ
If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process, then the policy will:
- degenerate to the Shortest-Job-First algorithm
- degenerate to the Priority Scheduling algorithm
- degenerate to the First-Come-First-Serve algorithm
- none of the above
Can anyone please explain me the answer?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
Solution | Source |
---|