MCQs: Special & Edge Cases in CPU Scheduling

Q1. In a preemptive priority scheduling system, starvation of a low-priority process can occur
even if the CPU is idle at times. This situation is possible when:

A. Context switching time is non-zero

B. The priority range is finite and fixed

C. Higher-priority processes arrive sporadically

D. Aging is implemented incorrectly

Q2. Round Robin scheduling provides the same waiting time for all processes only when:

A. Time quantum is very large

B. All processes arrive at the same time and have identical CPU bursts

C. Context switch time is zero

D. Processes are I/O bound

Q3. Which of the following scenarios violates the optimality of Shortest Job First scheduling?

A. Processes have different arrival times

B. CPU burst times are estimated using exponential averaging

C. CPU burst times are known exactly

D. Scheduling is non-preemptive
Q4. In Shortest Remaining Time First (SRTF) scheduling, a running process with remaining burst
time R will NOT be preempted when a new process arrives with burst time B such that:

A. B < R

B. B = R

C. B > R

D. B = 0

Q5. Which scheduling algorithm can cause convoy effect under heavy load?

A. Shortest Job First

B. Round Robin

C. First Come First Serve

Q6. In Round Robin scheduling, if the time quantum is slightly greater than the maximum CPU
burst of any process, the algorithm effectively behaves like:

A. SJF

B. FCFS

C. Priority Scheduling

D. Multilevel Queue Scheduling

Q7. Which condition is necessary for aging to completely eliminate starvation?

A. Priority increase must be linear

B. Priority increase must be exponential

C. Priority of waiting processes must eventually exceed all others

D. Context switching must be preemptive

Q8. A Multilevel Queue scheduling algorithm differs from Multilevel Feedback Queue
scheduling because:

A. It allows preemption across queues

B. It does not allow process migration between queues

C. It uses Round Robin in all queues

D. It dynamically adjusts time quantum

Q9. Which scheduling algorithm is MOST sensitive to inaccurate CPU burst prediction?

A. FCFS

B. Round Robin

C. SJF

D. Priority Scheduling

Q10. In a heavily I/O-bound system, which scheduling algorithm is most likely to maximize CPU
utilization?

A. FCFS

B. Round Robin
C. Non-preemptive Priority

D. SJF

Q11. In non-preemptive scheduling, the response time of a process is equal to its:

A. Waiting time

B. Turnaround time

C. Completion time

D. Burst time

Q12. Which of the following is TRUE regarding context switching overhead?

A. It is independent of the scheduling algorithm

B. It increases as time quantum decreases

C. It decreases CPU utilization

D. Both B and C

Answer Key 1.D 2.B 3.B 4.C 5.C 6.B 7.C 8.B 9.C 10.B 11.A 12.D

JUMP TO LATEST
Topic: Round Robin (RR) CPU Scheduling 1) MCQ (Single Correct)

Q1 Four processes arrive at time 0 with the following CPU burst times: Process Burst Time (ms)
P1 8 P2 4 P3 9 P4 5 Round Robin scheduling is used with time quantum = 3 ms. What is the
average waiting time (in ms)? Options:

A. 11.5 B. 12.0 C. 12.5 D. 13.0

2) MSQ (Multiple Correct)

Q2 Consider Round Robin scheduling with time quantum = 4 ms. All processes arrive at time 0.
Process Burst Time (ms) P1 10 P2 5 P3 8 Which of the following statements are TRUE?

Options:

A. P2 finishes before P3

B. P1 completes in the 3rd cycle

C. Average turnaround time is greater than 15 ms

D. P3 gets CPU exactly 3 times

3) NAT (Numerical Answer Type)

Q3 Three processes arrive at time 0 with CPU burst times 6 ms, 10 ms, and 14 ms. Round Robin
scheduling is used with time quantum = 4 ms. Compute the average turnaround time (in ms).
Answer should be rounded to one decimal place.

4) NAT (Concept + Calculation)

Q4 In a Round Robin scheduler, the time quantum is doubled, while the process set remains
unchanged. If the original average waiting time was 18 ms and the new average waiting time
becomes 15 ms, calculate the percentage reduction in average waiting time.

Answers Q1: C (12.5 ms) Q2: A, D Q3: 26.0 Q4: 16.7

A. CPU utilization is maximized

B. FCFS prevents starvation

C. A long CPU-bound process can delay I/O-bound processes even when the CPU is idle

D. FCFS minimizes turnaround time

Q2 Consider Round Robin scheduling with time quantum q. Let Tmax be the maximum CPU
burst time among all processes. For which condition does Round Robin become strictly identical
to FCFS for any arrival pattern?

A. q = Tmax

B. q > Tmax

C. q ≥ Tmax

D. q → ∞

Q3 All processes arrive at time 0. Under FCFS scheduling, which of the following reordering
strategies results in the minimum possible average waiting time?

A. Increasing order of arrival time

B. Decreasing order of burst time

C. Increasing order of burst time

D. Any order gives the same average waiting time

Q4 Which of the following statements about Round Robin scheduling is FALSE?

A. RR guarantees bounded waiting time

B. RR guarantees bounded response time

C. RR always improves response time compared to FCFS

D. RR can perform worse than FCFS for turnaround time

Q5 Which statement best describes starvation in pure Round Robin scheduling?

A. Starvation cannot occur under any circumstances

C. Starvation can occur if time quantum is very small

D. Starvation depends on arrival rate but not on time quantum identical waiting times \

E. RR and FCFS are incomparable

Q6 Consider a workload consisting entirely of CPU-bound processes with identical burst times,
all arriving at time 0. Which statement is correct?

A. RR always has lower average waiting time than FCFS

B. FCFS always has lower average waiting time than RR

C. FCFS and RR produce ide

MCQ 7 (RR – Context Switch Blind Spot)

Q7 Round Robin is often said to degrade performance for very small time quanta. The primary
reason for this degradation is:

A. Increased waiting time

B. Increased turnaround time

C. Excessive context switching

D. Starvation of long processes

Q8 Which of the following properties is guaranteed by FCFS scheduling?

A. Minimum average waiting time

B. No starvation

C. Bounded response time

D. Optimal turnaround time

Answers Q1: C Q2: C Q3: C Q4: C Q5: A Q6: C Q7: C Q8: B