first executes the job that needs minimal processor

first executes the job that came in last in the queue

first executes the job that came in first in the queue

first executes the job that has maximum processor needs

The FIFO algorithm :

1.	The FIFO algorithm :
A.	first executes the job that came in last in the queue
B.	first executes the job that came in first in the queue
C.	first executes the job that needs minimal processor
D.	first executes the job that has maximum processor needs
Answer» C. first executes the job that needs minimal processor

Discussion