Which of the following scheduling algorithms is non-preemptive?
20022025
Which of the following scheduling algorithms is non-preemptive?
Answer: B. First-In First-Out — First-In First-Out (FCFS) is a non-preemptive scheduling algorithm. Once a process begins execution, it continues until completion or voluntarily yields the…
- A.
Round Robin
- B.
First-In First-Out
- C.
Multilevel Queue Scheduling
- D.
Multilevel Queue Scheduling with Feedback
Attempted by 618 students.
Show answer & explanation
Correct answer: B
First-In First-Out (FCFS) is a non-preemptive scheduling algorithm. Once a process begins execution, it continues until completion or voluntarily yields the CPU. In contrast, Round Robin is preemptive as it switches processes after fixed time slices, and Multilevel Queue Scheduling often involves preemption based on priority levels.
A video solution is available for this question — log in and enroll to watch it.
Explore the full course: Iocl Engineers Officers Grade A Paper 2