Question: The FCFS algorithm is particularly troublesome for __
Correct Answer: C. c) time sharing systems
Explanation: FCFS (First Come First Served) is particularly troublesome for time-sharing systems.
In time-sharing systems, multiple users share the CPU, and each user expects a quick response. FCFS, where processes are executed in the order they arrive, can lead to long wait times for users whose processes are behind long-running ones. This results in poor responsiveness and user dissatisfaction.
To address this, time-sharing systems typically use scheduling algorithms like Round Robin or Priority scheduling, which provide better fairness and responsiveness.