Question 44

Computer Awareness Process and Thread Managements Medium

Which of the following scheduling algorithms gives minimum average waiting time?

(A) shortest job first
(B) Round robin
(C) priority
(D) First come first serve
View Dynamic Solution & Explanation
Correct Solution: Option A

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)