FIRST COME FIRST SERVE ALGORITHM

                  First come first Serve Algorithm

 

Process	Arrival time	Burst time	Completion time	Turn around time	Waiting time
P1	0	2	2	2	0
P2	1	2	4	3	1
P3	5	3	8	3	0
P4	6	4	12	6	2

 

 

 

P1

P2

////////////////////

P3

P4

0                                   2                                 4                                     5                                       8                      12          

 

 Let solve the algorithm by formula put:-

 

Turn around time = completion time – arrival time

Waiting time =  turn around time -  burst time

When we are solving the first come first serve algorithm firstly input the value always from arrival time

 

 

• Certainly, here's an example of the First-Come-First-Serve (FCFS) scheduling algorithm in tabular format:
• 
  
• process" represents the name or identifier of the process.
• 
  
• "Arrival Time" is the time at which the process arrives in the ready queue.
• 
  
• "Burst Time" is the time required by the process to complete its execution.
• 
  
• "Waiting Time" is the time the process has to wait before it starts execution.
• 
  
• "Turnaround Time" is the total time taken by a process to complete its execution, including both waiting and execution time.