Which scheduling algorithm minimizes wait time for small processes but can cause starvation?

• A. Shortest Job First
• B. First Come First Serve
• C. Round Robin
• D. Priority Scheduling

Answer: (A)

Shortest Job First works by always selecting the process with the smallest CPU burst time next. This focus on the shortest tasks means the CPU is kept busy with quick completions, which minimizes the waiting time for those small jobs and, on average, reduces overall waiting time for the system. However, this same preference for short jobs can cause longer tasks to wait indefinitely if a steady stream of short jobs keeps arriving, leading to starvation for the longer processes. The approach thus gives the best chance to minimize wait for small tasks but at the cost of potentially starving others.