Which of the following scheduling algorithms gives minimum average waiting time?
Step-by-step Solution:
Shortest Job First (SJF) is an optimal scheduling algorithm that selects the process with the shortest burst time first. It minimizes the average waiting time because shorter jobs are executed earlier, leading to lower delays for subsequent jobs. \[\] \[\] Correct Option: (a)