How it works:

First Come First Serve (FCFS) is a scheduling algorithm where processes are executed in the order they arrive. The CPU is allocated to the process that arrives first. Once a process gets the CPU, it runs until completion or until it's blocked.

• Algorithm Type : Non-preemptive
• Advantages : Simple, fair, low overhead
• Disadvantages : Convoy effect, not optimal