Question
Which scheduling algorithm assigns each ready process a small time slice in cyclic order?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Round robin
Explanation:
Round robin rotates through the ready queue and gives each process up to one time quantum.
It is widely used for time-sharing because it provides regular opportunities to run.
Leave a Reply