FIFO can exhibit Belady’s anomaly: an extra frame changes the eviction order and can create more faults. LRU and optimal replacement have the stack-inclusion property and cannot exhibit this effect. The conventional keyed choice is FIFO, D.
More Memory Management and Virtual Memory questions
GATE 2012 CS (CS1) Q52– With three initially empty frames, reference string is 1,2,3,2,4,1,3,2,4,1. Let…
GATE 2013 CS (CS1) Q62– Virtual addresses are 46 bits, physical addresses 32 bits. A three-level page table has…
GATE 2011 CS (CS1) Q30– Page-fault service time is 10 ms; normal memory access is 20 ns. One fault occurs per 10⁶…
GATE 2010 CS (CS1) Q34– FIFO page replacement has four initially empty frames. Access one hundred distinct pages…
GATE 2015 CS (CS2) Q41– Six fixed memory partitions have sizes 200,400,600,500,300,250 KB. Processes of…
GATE 2015 CS (CS2) Q43– A system has 8 KB pages and 32-bit physical addresses. Every page-table entry contains…