Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
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.
25% of 60 × 15% of 120 = 30% of (?)
262 × 15 + (?)² = 4099
20% of 550 × 25% of 80 = ?2 × 22
(15 × 225) ÷ (45 × 5) + 480 = ? + 25% of 1240
Ravi is 12 years younger than Surya. Ravi's age is 40% of the sum of his and Surya's age. What will be Surya's age 9 years hence?
115 ÷ 23 + 12 × 6 = ? + 16 - 35
3.55 + 1.05 + 2.5 × 13 – 12% of 12.5 = ?
120% of 400 + ?% of 520 = 1000
432 ÷ ? × 2552 ÷ 44 = 2088