Question

A FIFO replacement algorithm associates with each page the _______

a) time it was brought into memory
b) size of the page in memory
c) page after and before it
d) All of these

Answer 1

A FIFO replacement algorithm associates each page with the time it was brought into memory.

Step-by-step explanation:

A FIFO (First-In, First-Out) replacement algorithm associates with each page the time it was brought into memory. The algorithm keeps track of the order in which pages are brought into memory, and when a new page is needed and there is no space in memory, the oldest page (the one that arrived first) is replaced.

This algorithm does not consider the size of the page or the pages that come before or after it.

Therefore, the correct answer is (a) time it was brought into memory.