A FIFO page-replacement strategy can be implemented with relatively low overhead using a ________.
A) queue
B) hash table
C) binary tree
D) stack

Name: A FIFO page-replacement strategy can be implemented with relatively low overhead using a ________. A) queue B) hash table C) binary tree D) stack
Brand: Quizplus
Rating: 4.8 (30 reviews)

Question

Quizplus · Accepted Answer

A FIFO (First-In-First-Out) page-replacement strategy can be efficiently implemented using a queue, as it allows for easy insertion of new pages at the rear and removal of the oldest pages from the front.

A FIFO Page-Replacement Strategy Can Be Implemented with Relatively Low