New Register for Workshop on How to start for NABARD 2025 (Stepwise Plan) - Apr 26, 7 PM

    Question

    Which of the following is true about the Round Robin

    (RR) CPU scheduling algorithm?
    A It gives preference to shorter processes over longer ones Correct Answer Incorrect Answer
    B It uses a dynamic time quantum for each process Correct Answer Incorrect Answer
    C Each process gets an equal share of CPU time in a cyclic order Correct Answer Incorrect Answer
    D It is not preemptive in nature Correct Answer Incorrect Answer
    E It optimizes throughput over fairness Correct Answer Incorrect Answer

    Solution

    In the Round Robin CPU scheduling algorithm, each process is assigned a fixed time slice or quantum, and processes are scheduled in a cyclic order. If a process does not complete within its quantum, it is moved to the back of the queue to wait for its next turn. Why Other Options are Wrong: a) It does not prefer shorter processes; all are treated equally. b) Time quantum is fixed, not dynamic. d) Round Robin is preemptive since it interrupts processes after each time slice. e) The goal of RR is fairness, not throughput optimization.

    Practice Next