Which one or more of the following CPU scheduling algorithms can potentially cause starvation?

Starvation (indefinite blocking) occurs when a ready-to-run process waits indefinitely for the CPU because other processes are continually given preference.

• (A) First-in First-Out (FIFO): Under the standard assumption of finite execution times, FCFS guarantees that every process will eventually execute once all preceding processes finish. However, under non-preemptive execution where a preceding process enters an infinite loop or in continuous stream scenarios, subsequent processes may be starved. Hence, the official answer key accepted both {A, C, D} and {C, D}.

• (B) Round Robin: Processes are allocated the CPU for a fixed time quantum in a cyclic queue. Every runnable process is guaranteed a turn within a bounded time interval proportional to $(n - 1) \times q$, where $n$ is the number of processes and $q$ is the time slice. Therefore, Round Robin is starvation-free.

• (C) Priority Scheduling: If higher-priority processes keep arriving continuously into the ready queue, lower-priority processes may never receive the CPU, leading to starvation.

• (D) Shortest Job First (SJF): If shorter jobs keep arriving continuously, a long job with a large CPU burst time may never be scheduled, leading to starvation.

Thus, the correct options are A, C, D (or C, D).