Shortest job first is a special case of
-
FCFS scheduling
-
priority scheduling
-
round robin scheduling
-
gantt scheduling
-
None of these
B
Correct answer
Explanation
Shortest job first scheduling and priority scheduling are two algorithms used for scheduling. Shortest job first is a special case of priority scheduling.