

MCQOPTIONS
Saved Bookmarks
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 |
E. | None of the above |
Answer» C. execute first the job that has been in the queue the longest | |