The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+19 votes
1.3k views

Which of the following scheduling algorithms is non-preemptive?

  1. Round Robin
  2. First-In First-Out
  3. Multilevel Queue Scheduling
  4. Multilevel Queue Scheduling with Feedback
asked in Operating System by Veteran (52k points)
edited by | 1.3k views

2 Answers

+28 votes
Best answer
  1. Here we preempt when Time quantum is expired.
     
  2. We never preempt, so answer is (B) FIFO
     
  3. Here we preempt when process of higher priority arrives.
     
  4. Here we preempt when process of higher priority arrives or when time slice of higher level finishes & we need to move process to lower priority.
answered by Boss (41k points)
edited by
0
Your answer is obviously correct. However, can you give me a source for your reasoning for options C and D.

Galvin (8th ed) only says that the multilevel and multilevel feedback algorithms have an independent  scheduling algorithm for each queue, but dont specify when preemtion occurs.
0
Sir what does it mean by"when time slice of higher level finishes & we need to move process to lower priority."
0
@ rajinder singh

consider you have 3  queue  like A,B,C & each queue has own time slice 5,8,10 respectively

suppose  process P1 is executing in Queue B .but  B Queue time slice expired before finish Time slice of P1 . then you have to shift P1 process to  C Queue .
+7 votes
ans is b
answered by Boss (30.9k points)
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,535 questions
54,117 answers
187,307 comments
71,028 users