Which of the following CPU scheduling algorithms may cause starvation of a process? (1) First-Come-First-Served (2) Round Robin (3) Priority scheduling (4) Shortest-Process-Next (5) Shortest-Remaining-Time-First

Explanation

FCFS (1) serves processes strictly in arrival order with no reordering, so every process is eventually served — it cannot starve anyone. Round Robin (2) gives every ready process a guaranteed time slice in rotation, so it also cannot starve a process. Priority scheduling (3) can starve a low-priority process indefinitely if higher-priority processes keep arriving. Shortest-Process-Next (4) and Shortest-Remaining-Time-First (5) can both starve a long process if a continuous stream of shorter jobs keeps being favoured. So the starvation-prone set is {3, 4, 5}, option (ii).