FCFS (First-Come, First-Served) is a scheduling algorithm where the first process to request a resource is the first to be allocated that resource, ensuring fairness but potentially leading to inefficiencies like the convoy effect. It is simple to implement but does not prioritize tasks, which can result in longer average wait times for processes that arrive later with shorter execution times.