Question

Which one or more of the following CPU scheduling algorithms can potentially cause starvation?

• A. First-in First-Out
• B. Round Robin
• C. Priority Scheduling
• D. Shortest Job First

Hint:

Starvation happens when some processes wait indefinitely. It commonly occurs in scheduling policies that favor certain types of jobs (short jobs or high-priority jobs). Round Robin avoids starvation since every process gets CPU time fairly.

Answer 1

The Correct Option is A

Step 1: Analyze Option (A) First-in First-Out (FIFO)
In FIFO (or FCFS), processes are scheduled in the order of their arrival. However, a very long job at the front can delay all other processes (known as the “convoy effect”). Short processes behind it may wait indefinitely long if long jobs keep arriving. This is a form of starvation.
\(\Rightarrow\) (A) can cause starvation. Step 2: Analyze Option (B) Round Robin
Round Robin ensures fairness by giving each process a fixed time slice in cyclic order. Every process eventually gets CPU time, so starvation is avoided.
\(\Rightarrow\) (B) does not cause starvation.
Step 3: Analyze Option (C) Priority Scheduling
In Priority Scheduling, higher priority processes are executed first. If higher-priority processes keep arriving, lower-priority processes may never get CPU time. This indefinite waiting is starvation.
\(\Rightarrow\) (C) can cause starvation.
Step 4: Analyze Option (D) Shortest Job First (SJF)
In non-preemptive SJF, if short jobs keep arriving, longer jobs may get postponed indefinitely. In preemptive SJF (Shortest Remaining Time First), a long process can be repeatedly preempted by shorter ones. Both situations may lead to starvation of long processes.
\(\Rightarrow\) (D) can cause starvation. \[ \boxed{\text{Correct Options: (A) FIFO, (C) Priority Scheduling, and (D) Shortest Job First}} \]