Computer Science · Operating Systems
Which is the correct option for the Round-Robin (RR) Scheduling algorithm? Statement-1: If there are n processes in the ready queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units. Each process must wait no longer than (n - 1) × q time units until its next time quantum. Statement-2: The RR scheduling algorithm is nonpreemptive and the average waiting time under the RR policy is often short.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement-1 is False and Statement-2 is True
- 2Statement-1 is True and Statement-2 is True
- 3Statement-1 is False and Statement-2 is False
- 4Statement-1 is True and Statement-2 is False✓
Correct answer
Statement-1 is True and Statement-2 is False
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems