What is First Cum First Serve?
First Come First Serve (FCFS) is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival. It is the easiest and simplest CPU scheduling algorithm. In this type of algorithm, processes which requests the CPU first get the CPU allocation first. This is managed with a FIFO queue. The full form of FCFS is First Come First Serve.
Coded in C++
Characteristics of FCFS
- It supports non-preemptive and pre-emptive scheduling algorithm.
- Jobs are always executed on a first-come, first-serve basis.
- It is easy to implement and use.
- This method is poor in performance, and the general wait time is quite high.
Application file added to the repo for testing
Preffered IDE = Visual Studio code // Codeblocks
File save extension - .cpp
Important Links
Codeblocks Install - Download Codeblocks
Visual Studio Code Install - Download Visual Studio Code