Which CPU scheduling algorithm executes processes in the order of their arrival without preempting a running process?

Options

  • A. Shortest Remaining Time First
  • B. Round Robin
  • C. First Come First Served
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. First Come First Served

Detailed Explanation

Explanation: First Come First Served (FCFS) is a non-preemptive scheduling algorithm. Processes are executed according to their arrival order. A major disadvantage of FCFS is the convoy effect, where short processes may wait behind a long process.

← Previous Next →

Attempt Quiz Now:

Operating system Quiz all chapter practice set

Feature Posts