Explain First Come First Served (FCFS).

Q1. Explain First Come First Served (FCFS).

Ans. This is a Non-Preemptive scheduling algorithm. FIFO strategy assigns priority to processes in the order in which they request the processor. This process that requests the CPU first is allocated the CPU first. This is easily implement with a FIFO (First In First Out) queue for managing the tasks, as the process come in, they are put at the end of the queue. As the CPU finishes each task, it removes it from the start of the queue and heads on to the next task.

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: