A FIFO page replacement algorithm correlates with every page to know the time when that page was brought into memory. When a page becomes to be replaced, the oldest page is chosen. It is not necessary to record the time when the page was brought in. for this we can create a FIFO queue to hold all pages into memory. We simply replace the page at the head of the queue.

Question No: 34( Marks: 2 )

The problem with using an acyclic-graph structure is ensuring that there are no cycles. What is the solution?