Q3. What are the limitations of FCFS scheduling algorithm? Explain with the help of above question.
Ans. If we just change the order to P2, then P3, then P1, then
Waiting Time for P1=6
Average Waiting Time
Clearly, the average waiting time under a purely first-in first-out system is going to often be poor if one task is significantly longer than the others.
0 3 6 30