The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+14 votes
902 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 (59.4k points)
edited by | 902 views

2 Answers

+23 votes
Best answer
A) Here we preempt when Time quantum is expired.

C) Here we preempt when process of higher priority arrives.

D) 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.

B) We never preempt, so answer is B) FIFO
answered by Boss (42.4k points)
selected 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.
+7 votes
ans is b
answered by Boss (31.4k points)


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

34,832 questions
41,810 answers
119,070 comments
41,453 users