Start learning 50% faster. Sign in now
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 :