What scheduling algorithm prioritizes processes based on their remaining computation requirements, preempting a running process if a shorter task enters the ready queue? MCQ with Answer and Explanation
What scheduling algorithm prioritizes processes based on their remaining computation requirements, preempting a running process if a shorter task enters the ready queue?
A. First-Come, First-Served (FCFS)
B. Static Priority Scheduling
C. Shortest Remaining Time First (SRTF)
D. Round Robin (RR)
Answer: Option C
Solution (By JKSSB Mock Tests)
Shortest Remaining Time First (SRTF) is a preemptive variant of SJF that continuously evaluates remaining runtime, switching to shorter newly arrived tasks.
No comments yet. Be the first to start the discussion!