First Come First Serve (FCFS) automatically executes queued requests and consequently executes in order of their appearance. It is the straightforward and least difficult CPU scheduling algorithm. In this, measures which request the CPU initially get the CPU allocation first. This is controlled with a FIFO queue. As the process enters the ready queue, its Process Control Block is connected with the queue and, when the CPU becomes free, it should be appointed to the process at the start of the queue.