Which CPU scheduling algorithm always selects the process with the smallest burst time first, potentially leading to starvation?

Shortest Job First (SJF) selects the process with the smallest burst time for execution. This reduces the average waiting time and is optimal in that sense. However, it can cause starvation for longer processes if smaller processes keep arriving, as they continually preempt the longer ones. SJF can be preemptive (Shortest Remaining Time First) or non-preemptive. The algorithm is often used in batch systems where burst times are known beforehand. For example, it works well in scenarios like batch job execution in legacy systems. Why Other Options Are Incorrect :

1. Round Robin (RR) : Ensures fairness by assigning equal time slices, but does not prioritize based on burst time.
2. First Come First Serve (FCFS) : Simple but may lead to poor average waiting time if a long process arrives first.
3. Priority Scheduling : Schedules based on priority, not burst time, and may also lead to starvation of low-priority tasks.
4. Multilevel Queue Scheduling : Divides processes into multiple queues based on priority or type, but does not specifically prioritize short jobs.