First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.Select one:TrueFalse

Answer

The statement "First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes" is False.

Explanation

FCFS scheduling does not inherently favor I/O bound processes over CPU bound processes. Instead, it operates on a very straightforward principle: the first process that arrives in the queue gets executed first, without any consideration for the type of process. While I/O bound processes may complete faster because they spend less time using the CPU, this is not a direct result of the scheduling policy itself. Both types of processes—CPU bound and I/O bound—are treated equally under FCFS, with no optimization for either. Consequently, if a CPU bound process is at the front of the queue, it can lead to longer wait times for subsequent I/O bound processes, potentially resulting in inefficiencies in the overall scheduling performance. Therefore, the statement is indeed false.