276. The FIFO algorithm

executes first the job that last entered the queue
executes first the job that first entered the queue
execute first the job that has been in the queue the longest
executes first the job with the least processor needs
✅ The correct answer is option B.

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top