Question

The ___________ policy manages the frames of a page allocated/assigned to a particular process as a circular buffer, removing pages in a round-robin fashion.

a) LRU (Least Recently Used)
b) FIFO (First-In-First-Out)
c) MRU (Most Recently Used)
d) LFU (Least Frequently Used)

Answer 1

The FIFO (First-In-First-Out) policy manages page frames as a circular buffer by removing pages in the order they were inserted.

Step-by-step explanation:

The policy that manages the frames of a page allocated to a particular process as a circular buffer, removing pages in a round-robin fashion is the FIFO (First-In-First-Out) policy. This page replacement algorithm removes pages in the order they were entered, quite literally first in, first out. As new pages are loaded into the memory, the oldest pages are removed to make space for the new ones. Despite its simplicity, FIFO can lead to the phenomenon called Belady's anomaly, where increasing the number of page frames results in an increase in the number of page faults.