Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2002 | Question 22

  • Last Updated : 28 Jun, 2021

Which of the following scheduling algorithms is non-preemptive?
(A) Round Robin
(B) First-In First-Out
(C) Multilevel Queue Scheduling
(D) Multilevel Queue Scheduling with Feedback

Answer: (B)
Explanation: Round Robin – Preemption takes place when the time quantum expires

First In First Out – No Preemption, the process once started completes before the other process takes over

Multi Level Queue Scheduling – Preemption takes place when a process of higher priority arrives

Multi Level Queue Scheduling with Feedback – Preemption takes a place when process of higher priority arrives or when the quantum of high priority queue expires and we need to move the process to low priority queue


So, B is the correct choice.


Please comment below if you find anything wrong in the above post.
Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :