Question

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________
A. LRU
B. LFU
C. FIFO
D. NONE

Answer 1

Answer:

C. FIFO

Explanation:

The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires work on the part of the operating system. On a page fault, the frame that has been in memory the longest is replaced.

Using FIFO algorithm implies that

a page which was brought into memory first will be removed first since variable was initialized very early. it is in the set of first in pages that will be removed.

It is the simplest page replacement algorithm. The operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal that is first in first out.

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is called First In First Out.