It is the simplest of all the Disk Scheduling Algorithms. In FCFS, the requests are addressed in the order they arrive in the disk queue.

1. In FCFS disk scheduling, there is no indefinite delay.


2. There is no starvation in FCFS disk scheduling because each request gets a fair chance.

1. FCFS scheduling is not offered as the best service.


2. In FCFS, scheduling disk time is not optimized.

1. A request array contains the indexes of the tracks that have been requested in ascending order of time interval. The position of the read/ write head is 'HEAD'.


2. These tracks are addressed one by one in default order and the absolute distance of the track from the head is calculated.


3. The total seek count is incremented with this distance.


4. Go to step 2 until all the tracks are not been addressed.