edited by
18,085 views

5 Answers

Best answer
50 votes
50 votes
  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
6 votes
6 votes
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
1 votes
1 votes
Multi level Queue Scheduling can be both Preemptive and non preemptive depending on whether FCFS like algo’s are on the top level or not.

Generally, we dont place FIFO/FCFS on top level, so saying 100% surely that MLQ scheduling is non preemptive wont be a fair thing

But FCFS or FIFO in process scheduling is definately non preemptive, and hence it causes starvation.

So definately FCFS/FIFO is the right answer.

 

 

PS: FCFS in disk scheduling, does not cause starvation.
Answer:

Related questions

21 votes
21 votes
1 answer
1
Kathleen asked Sep 15, 2014
8,014 views
The optimal page replacement algorithm will select the page thatHas not been used for the longest time in the pastWill not be used for the longest time in the futureHas b...
28 votes
28 votes
4 answers
2
Kathleen asked Sep 15, 2014
6,796 views
Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...
39 votes
39 votes
8 answers
4
Kathleen asked Sep 15, 2014
17,670 views
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}$