FCFS implementation in C
Simulation of FCFS CPU scheduling algorithms to find turnaround time and waiting time
We are given with n processed with there arrival time and burst time,task is to find average waiting time and average turn around time.
Algorithm is simple as waiting in lines for our order in a burger shop where the first person is served first from where we get the FCFS as First Come First Serve also known as First in First out.
Things to remember
- FCFS is a non-pre-emptive scheduling
- Avg waiting time is not optimum compared to other scheduling
- Has Convay effect
Comments
Post a Comment