IMPLEMENTATION - First Come First Serve (FCFS)



  • Input the number of processes required to be scheduled using FCFS, burst time for each process and its arrival time.

  • Using enhanced bubble sort technique, sort the all given processes in ascending order according to arrival time in a ready queue.

  • Calculate the Finish Time, Turn Around Time and Waiting Time for each process which in turn help to calculate Average Waiting Time and Average Turn Around Time required by CPU to schedule given set of process using FCFS.
Invalid Input
PLAY
RESET
Average TAT : 0
Average WT : 0
Average RT : 0
ADD
PID AT BT ST CT RT WT TAT