What is the simplest CPU scheduling Algorithm?

What is the simplest CPU scheduling Algorithm?

• FCFS scheduling algorithm
• Multilevel scheduling algorithm
• Round robin scheduling algorithm
• SJF scheduling algorithm 

EXPLANATION

First-Come First-Served Scheduling:-

The process which comes first is executed first.
The simplest CPU scheduling algorithm is the first-come, first-served (FCFS) scheduling algorithm. With this scheme, the process that requests the CPU first is allocated the CPU first. The implementation of the FCFS policy is easily managed with a FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. The code for FCFS scheduling is simple to write and understand. The average waiting time under the FCFS policy, however, is often quite long.