1. A) First-Come-First-Serve : In this method, the process which requests
the CPU first is allocated the CPU first. The algorithm can be
implemented with FIRST IN FIRST OUT (FIFO) Queue. The following example
illustrates. The following is the order in which the jobs arrive and their
burst times.
From the
above, we see that the order in which the jobs arrive play an
important role. If the jobs arrive in the order 2,3,1 the average
turn around time is 13.