1 1 vote Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ? Operating System operating-system al + – VS 1.9k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments VS commented Jan 24, 2018 reply Follow flag @Anu007 sir Any reference? Its still not very clear to me :( Why MRU is a stack algo ? 0 0 replyShare abhishek tiwary commented Jan 24, 2018 reply Follow flag https://cseweb.ucsd.edu/classes/sp02/cse120_B/stack.html 0 0 replyShare Anu007 commented Jan 24, 2018 reply Follow flag A stack page replacement policy is a policy that assigns a priority to a page that is independent of the number of page frames. https://cseweb.ucsd.edu/classes/sp02/cse120_B/stack.html they talk about LFU and LRU. https://en.wikipedia.org/wiki/Page_replacement_algorithm Read here in Heading Least Recently Used 3 3 replyShare Please log in or register to add a comment.