In a FIFO algorithm, when a page is to be replaced, which of the following page is chosen?
(a) Oldest page
(b) Newest page
(c) Frequently occurred page in past
(d) Frequently occurred page in future
I have been asked this question by my school principal while I was bunking the class.
My question is based upon Page Replacement Algorithms topic in section Page Replacement Algorithms of Data Structures & Algorithms II