Which of the following scheduling algorithm gives a minimum average waiting…

Shortest Job First (SJF) scheduling is theoretically proven to minimize the average waiting time for a set of processes. Unlike First Come First Serve (FCFS), which can suffer from the convoy effect, or Round Robin and Priority scheduling which prioritize fairness or specific criteria over optimization, SJF selects the process with the smallest burst time next. This strategy ensures that shorter processes do not wait behind longer ones, resulting in the lowest possible average waiting time.