'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:

  1. degenerate to the Shortest-Job-First algorithm
  2. degenerate to the Priority Scheduling algorithm
  3. degenerate to the First-Come-First-Serve algorithm
  4. 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