It is also known as FIFO, i.e. first in first out. We can also write C/C++ program for first come first serve scheduling algorithm. Example: real-life example of FCFS is buying a ticket on the ticket counter. In this, a person is served according to queue manner. The man who arriv...
Gantt ChartIn this example, we can see the waiting times of both phases. However, the length of the schedule is the same that is 41 units but the waiting time will be lesser in this schedule.Average waiting Time = 5+1+0/3 = 6/3 = 2How to Avoid Convoy Effect in FCFS Scheduling?