Which one of the following CPU scheduling algorithms cannot be preemptive?

2026

Which one of the following CPU scheduling algorithms cannot be preemptive?

Answer: B. First Come First Serve (FCFS) Scheduling — First Come First Serve (FCFS) is inherently non-preemptive because once a process begins execution, it runs to completion. Other algorithms like Round Robin…

  1. A.

    Shortest Remaining Time First (SRTF) Scheduling

  2. B.

    First Come First Serve (FCFS) Scheduling

  3. C.

    Round Robin Scheduling

  4. D.

    Priority Scheduling

Attempted by 619 students.

Show answer & explanation

Correct answer: B

First Come First Serve (FCFS) is inherently non-preemptive because once a process begins execution, it runs to completion. Other algorithms like Round Robin allow interruption based on time slices or priority changes.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…