A. First Come First Served (FCFS) Scheduling
It is the simplest CPU Scheduling algorithm. The criteria
of this algorithm are the process that requests first, hold
the CPU first ‟or which process enter the ready queue first
is served first. The workload is processed in the order of
arrival time, with no preemption. Once a process has been
submitted to the CPU, it runs into completion without
being interrupted. Such a technique is fair in the case of
smaller processes but is quite unfair for long an
unimportant job. Since FCFS does not involve context
switching therefore it has minimal overhead. It has low
throughput since long processes can keep processor
occupied for a long time making small processes suffer. As
a result waiting time, turnaround time and response time
can be low.