Which of the following scheduling algorithms gives minimum average waiting time?
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)
Reinforce your conceptual grasp with related questions from CUET-MCA 2021:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →