/* first come first serve algorithm for scheduling. */
The simplest CPU scheduling algorithm is the first come first served scheduling(FCFS) algorithm. The process that requests the CPU first is allocated the CPU first. A queue of waiting processes is maintained in FCFS order. When a process completes, thw next process in the queue is allocated the CPU. The FCFS algorithm is non pre- emptive.
Written with ♥ from Mangesh.
|1||C program for first come first serve scheduling.|
|2||C program for shortest job first scheduling algorithm.|
|3||C program for shortest remaining time first scheduling algorithm.|
|4||C program for round robin scheduling algorithm.|