Question

In the first come first service (FCFS) scheduling algorithm, which process is executed first?

• A. The process with the shortest burst time
• B. The process that arrives first
• C. The process with the highest priority
• D. The process with the longest burst time

Hint:

FCFS scheduling is based entirely on the chronological arrival sequence: First to Arrive = First to be Processed.

Answer 1

The Correct Option is B

Concept: The First-Come, First-Served (FCFS) scheduling algorithm manages tasks using a queue structure based on arrival order.

• FCFS Strategy: A non-preemptive scheduling policy that allocates resources to tasks in the exact order they enter the ready queue.

• Alternative strategies include Shortest Job First (SJF) (prioritizes the shortest burst time) and Priority Scheduling (prioritizes the highest assigned rank).

Step 1: Apply the queue policy to the options. The FCFS algorithm operates on a First-In, First-Out (FIFO) basis, similar to a standard service queue. The resource manager checks the arrival timestamps of all pending tasks and allocates execution capacity to the task with the earliest timestamp. Therefore, the process that arrives first is executed first, regardless of its processing length or priority rank.