Among the following CPU scheduling algorithms, which is most likely to cause…

2026

Among the following CPU scheduling algorithms, which is most likely to cause starvation for long-running processes?

  1. A.

    Shortest Job First (SJF) - non-preemptive

  2. B.

    Round Robin (RR)

  3. C.

    First-Come, First-Served (FCFS)

  4. D.

    Multilevel Feedback Queue

Attempted by 154 students.

Show answer & explanation

Correct answer: A

Correct answer: Shortest Job First (SJF) - non-preemptive

  • SJF chooses the process with the smallest CPU burst first.

  • If short jobs keep arriving, a long-running process may repeatedly be postponed and can suffer starvation.

  • Preemptive SJF/SRTF is also a classic starvation case, but it is not listed here. Among the given options, SJF is still the best answer for starvation of long-running processes.

Round Robin and FCFS are more fairness-oriented for already waiting processes, so they are not the intended answer.

Explore the full course: Niacl Ao It Specialist