Q396
The SJF algorithm executes first the job
A.
that last entered the queue
B.
that first entered the queue
C.
that has been in the queue the longest
D.
with the least processor needs
AnswerE.
None of the above
Answer: Option D
Solution
Answer: Option D
Solution:
The shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next.