6
Q:
A) Preemptive scheduling | B) Non preemptive scheduling |
C) Both A & B | D) None of the above |
Answer: A) Preemptive scheduling
Explanation:
Explanation:
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. It falls under the category of Preemptive scheduling. In computing, the running task is interrupted for some time without requiring its cooperation and resumed later when the priority task has finished its execution. This is called preemptive scheduling.