Which of the following describes a CPU scheduling algorithm in which each process is given a small amount of time to use the CPU before being forced to wait until its turn comes around again?
A) Shortest-job-next
B) First-come, first-served
C) Time slice
D) Round robin
E) Turnaround time

Question

Quizplus · Accepted Answer

Round robin is a CPU scheduling algorithm where each process is assigned a fixed time slot (time slice) in a cyclic order, ensuring all processes get an equal share of the CPU.

Which of the Following Describes a CPU Scheduling Algorithm in Which