FCFS stands for First-Come, First-Served. It is the simplest CPU scheduling algorithm where processes are executed in the exact order they arrive in the ready queue. The first process to arrive gets executed first, followed by the second, and so on. This algorithm follows a simple first-in, first-out principle, making it very easy to understand and implement.
FCFS is a non-preemptive scheduling algorithm. This means once a process starts execution, it runs continuously until it completes, without being interrupted by other processes. The scheduler simply picks the first process from the ready queue and allocates the CPU to it. The process execution follows a strict first-come, first-served order based on arrival time.