Problem Statement
Which scheduling algorithm can lead to starvation of a process if implemented without safeguards?
Explanation
In priority scheduling, if processes with low priority keep arriving, then a low priority process might never get CPU time. Without an aging mechanism (which increases priority over time), starvation becomes possible. FCFS and non-preemptive SJF will eventually serve everyone; Round Robin gives each process a time slice so starvation is less likely.
