Three processes arrive at time 0 with burst times 5, 3, and 1 unit respectively. The scheduler always selects the process with the smallest burst time next. The order of execution will be?
Show Hint
SJF is the "Provably Optimal" algorithm for minimizing average waiting time. By getting the "short" jobs out of the way quickly, we prevent them from waiting behind long-running jobs (avoiding the Convoy Effect).