Discussion :: Operating System
- 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 |
Whatsapp
Facebook
Answer : Option B
Explanation :
The simplest page-replacement algorithm is a FIFO algorithm. The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires little bookkeeping on the part of the operating system. In simple words, on a page fault, the frame that has been in memory the longest is replaced.
Be The First To Comment