Question
Which preemptive algorithm always runs the process with the least remaining CPU time?
Select an option. Your answer will be checked instantly.
Correct Answer: C. Shortest-remaining-time-first
Explanation:
Shortest-remaining-time-first is the preemptive form of shortest-job-first.
A newly arrived process can preempt the current process if it has a shorter remaining burst.
Leave a Reply