A FIFO replacement algorithm links with each page the time when that page was added into the memory The oldest page is chosen when a page is going to be replaced. We can create a FIFO queue to hold all the pages present in the memory disk. At the head of the queue we replace the p...