First Come First Serve (FCFS) Scheduling

It is the simplest CPU scheduling algorithm. The criteria of this algorithm are the process that requests the CPU first is holds the CPU first or which process enters the ready queue first is served first. The operating system maintains a data structure that is a ready queue. If a process request the CPU then it is loaded into the ready queue which process is the head of the ready queue.