In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________
(a) whenever a page is used, it is removed from the stack and put on bottom
(b) the bottom of the stack is the LRU page
(c) the top of the stack contains the LRU page and all new pages are added to the top
(d) none of the mentioned
I got this question in an interview for internship.
Origin of the question is Virtual Memory in division The Linux System of Operating System