Question

In FIFO page replacement algorithm, when a page must be replaced:

a) Oldest page is chosen
b) Newest page is chosen
c) Random page is chosen
d) None of the mentioned

Answer 1

In the FIFO page replacement algorithm, the oldest page is chosen for replacement when a new page needs to be loaded into memory. Therefore, the answer is option A.

Step-by-step explanation:

In the FIFO page replacement algorithm, when a page in memory needs to be replaced, the oldest page is chosen (option A). FIFO stands for First-In, First-Out, which means that the pages are kept in a queue, and the page that has been in memory the longest without being replaced is the first one to be replaced when a new page needs to be loaded into memory.