Step 1: SJF Definition. SJF (Shortest Job First) is a non-preemptive CPU scheduling algorithm. It selects the process with the shortest burst time for immediate execution, thereby minimizing the average waiting time.
Step 2: Evaluation of Alternatives. - (1) FCFS: First Come First Serve processes tasks based on arrival sequence, disregarding burst time. - (3) Round Robin: This algorithm allocates fixed time slices to processes, irrespective of their burst durations. - (4) Priority Scheduling: Process selection is determined by assigned priority levels, not by burst time.
Step 3: Final Determination. The appropriate choice is SJF, which prioritizes the process exhibiting the shortest burst time.