Project ForgeOperating Systems
Process Scheduling
GATE 2023
Medium
Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
- AFirst-in First-Out
- BRound Robin
- Priority Scheduling
- Shortest Job First
Explanation
FIFO/FCFS never starves any process — every process is eventually served strictly in arrival order. Round Robin guarantees every ready process a turn within one full cycle through the queue, so it also can't starve anyone. Priority Scheduling CAN starve low-priority processes indefinitely if higher-priority processes keep arriving. Shortest Job First CAN starve long jobs indefinitely if a steady stream of shorter jobs keeps arriving and jumping ahead of them.
Source: GATE CS 2023 (2023)
This question is part of a 15-day revision cycle — sign in and Project Forge will bring it back the day before you'd forget it.