Home » Operating Systems » Operating systems miscellaneous » Question

Operating systems miscellaneous

  1. Which of the following scheduling algorithms is non-pre-emptive?
    1. Round Robin
    2. First-in-First out
    3. Multilevel Queue Scheduling
    4. Multilevel Queue Scheduling with Feedback
Correct Option: B

Round robin is preemptive since processes are cycled for CPU time, & run for a particular time stamp in one cycle. Multilevel queue scheduling maintains various quenes, each having different priorities. But in FIFO scheme, only the process which enters once, would be completed first, so no. preemption. Hence (b) is correct option.



Your comments will be displayed only after manual approval.