Which CPU scheduling algorithm can cause starvation of low-priority processes?
2026
Which CPU scheduling algorithm can cause starvation of low-priority processes?
- A.
First Come First Serve (FCFS)
- B.
Round Robin
- C.
Priority Scheduling
- D.
Shortest Job First (SJF)
Attempted by 164 students.
Show answer & explanation
Correct answer: C
Correct answer: Priority Scheduling
Starvation means indefinite waiting. In priority scheduling, a low-priority process may keep waiting if higher-priority processes continue to arrive.
Why not SJF here? SJF can also starve long jobs, but the clarified question is about starvation of low-priority processes. That case points to priority scheduling.