# GATE2002-1.22

3.1k 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

edited

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.

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 .
ans is b
0
FCFS - non-preemptive

Round robin -  preemptive

Multilevel Queue Scheduling - preemptive

Multilevel Queue Scheduling with Feedback - preemptive

SJF - non-preemptive

SRTF - preemptive

LRTF - preemptive

Highest Response ratio first - non-preemptive
NON PREEMPTIVE  PROPERY FOLLOW ONLY FCFS

BCZ ONCE YOU GIVE CPU TO PROCEES WE DOES TAKE UNTIL IS FINISH THE WORK SO THAT WHY NON PREEMPTIVE IS ONLY OPTION IS FCFS

## Related questions

1
2.4k views
The optimal page replacement algorithm will select the page that Has not been used for the longest time in the past Will not be used for the longest time in the future Has been used least number of times Has been used most number of times
The maximum number of edges in a n-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$