execute first the job that has been in the queue the longest

executes first the job that last entered the queue

executes first the job that first entered the queue

executes first the job with the least processor needs

The FIFO algorithm – McqOptions

1.	The FIFO algorithm
A.	executes first the job that last entered the queue
B.	executes first the job that first entered the queue
C.	execute first the job that has been in the queue the longest
D.	executes first the job with the least processor needs
Answer» C. execute first the job that has been in the queue the longest

Discussion