Which one or more of the following CPU scheduling algorithms can potentially…

Answer: Priority Scheduling and Shortest Job First can potentially cause starvation.

Why Priority Scheduling can cause starvation:

• Low-priority processes may be deferred indefinitely if higher-priority processes keep arriving, preventing them from ever getting CPU time.

Why Shortest Job First can cause starvation:

• Long-running processes can be repeatedly postponed if shorter jobs continue to arrive, especially in the preemptive Shortest Remaining Time First variant.

Why First-in First-Out does not cause starvation:

• FCFS processes jobs in arrival order, so every process that joins the ready queue will eventually be served.

Why Round Robin does not cause starvation:

• Each ready process is given a time slice in cyclic order, guaranteeing that every process receives CPU time and preventing indefinite postponement.

Mitigation:

• Use aging to gradually increase the priority of waiting processes to prevent starvation in priority-based schemes.

• Design scheduling policies that bound wait times or combine fairness mechanisms with performance goals.

Final selection: Priority Scheduling; Shortest Job First.