Which of the following is a scheduling algorithm that allows a process to run until it blocks or is preempted by a higher priority process? MCQ with Answer and Explanation
Which of the following is a scheduling algorithm that allows a process to run until it blocks or is preempted by a higher priority process?
A. Preemptive priority scheduling
B. Non-preemptive priority scheduling
C. Round Robin
D. Multilevel feedback queue
Answer: Option B
Solution (By JKSSB Mock Tests)
Non-preemptive priority scheduling allows a process to keep the CPU until it finishes or voluntarily yields, unless a higher priority process arrives (which would preempt in preemptive scheduling).
No comments yet. Be the first to start the discussion!