FCFS First come first serve scheduling algorithm. FCFS works by using the numerical algorithm.
We are given the process number P1, P2, P3, P4 and arrival time. We 'll serve the one which
came first and mode is non preemptive. P1, P2, P3, P4. . . P3 arrived at 5 ' O clock so we 'll start
executing P3. P4 arrived at 6 and 6 has already passed Means P4 has already arrived in the
ready queue. Turn around time TAT is that for how much time a process stayed in the system.
FCFS is non preemptive so there 's no benefit of calculating the response time in this case.
Response time = time at which the process got the CPU first time - arrival time. P1 stayed in the
system for 2 unit time. . . then obviously waiting time arrived 0. P2 arrived at 1 but it git its turn
at 2 so that 's why it had to wait for its 1 unit time there.
We are given the process number P1, P2, P3, P4 and arrival time. We 'll serve the one which
came first and mode is non preemptive. P1, P2, P3, P4. . . P3 arrived at 5 ' O clock so we 'll start
executing P3. P4 arrived at 6 and 6 has already passed Means P4 has already arrived in the
ready queue. Turn around time TAT is that for how much time a process stayed in the system.
FCFS is non preemptive so there 's no benefit of calculating the response time in this case.
Response time = time at which the process got the CPU first time - arrival time. P1 stayed in the
system for 2 unit time. . . then obviously waiting time arrived 0. P2 arrived at 1 but it git its turn
at 2 so that 's why it had to wait for its 1 unit time there.
