Average waiting time 0 5 0 8 3 5 16 5 32 unit. Wti bt0 bt1. As we have taken arrival time to be 0 therefore turn around time and completion time will be same.
Easy to program.
Given n processes with their burst times the task is to find average waiting time and average turn around time using FCFS scheduling algorithm. As we have taken arrival time to be 0 therefore turn around time and completion time will be same. Given n processes with their burst times the task is to find average waiting time and average turn around time using FCFS scheduling algorithm. To calculate the waiting time for all processes use the formula Waiting time Response time Arrival time So the waiting time for 4 processes is P1 0 0 0.