0
Which non-preemptive CPU scheduling algorithm gives the minimum average waiting time for a set of processes that all arrive at the same time?
- AFCFS
- BSJF (Shortest Job First)
- CRound Robin
- DPriority scheduling with arbitrary priorities
Correct answer: B