Which of the following statements best describes a limitation of FCFS scheduling related to waiting time and system responsiveness?

medium🪤 Complexity Trap Q13 of Q15

Operating Systems - FCFS Scheduling - Convoy Effect & Waiting Time

AFCFS can cause long waiting times for short processes due to the convoy effect

BFCFS guarantees the shortest average waiting time among all scheduling algorithms

CFCFS allows preemption to improve responsiveness for interactive processes

DFCFS scheduling complexity grows exponentially with the number of processes

Step-by-Step Solution

Step 1: Evaluate each statement
A is correct because FCFS can cause long waiting times for short processes due to the convoy effect.
B is incorrect because FCFS does not guarantee the shortest average waiting time; algorithms like SJF do.
C is incorrect because FCFS is non-preemptive and does not allow preemption.
D is incorrect because FCFS scheduling complexity is O(n), simple queue processing.
Step 2: Identify the limitation
The convoy effect causing long waiting times for short processes is a key limitation.
Final Answer:
Option A -> Option A
Quick Check:
FCFS is simple but can cause poor responsiveness due to the convoy effect.

Quick Trick: FCFS = simple but convoy effect hurts short jobs

Common Mistakes:

MISTAKES

Trap Explanation:

PITFALL

Option A is tempting because shortest average waiting time is a common goal, but FCFS does not achieve it. Option C confuses FCFS with preemptive scheduling. Option D exaggerates complexity.

Interviewer Note:

CONTEXT

Tests understanding of FCFS limitations and trade-offs in waiting time and responsiveness.

Master "FCFS Scheduling - Convoy Effect & Waiting Time" in Operating Systems

2 interactive learning modes - each teaches the same concept differently

Want More Practice?

15+ quiz questions · All difficulty levels · Free

More Operating Systems Quizzes