GATE | CS | 2012 | Operating System | Memory Management | Question 42

Last Updated :
Discuss
Comments

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then

OPTIMAL < LRU < FIFO

OPTIMAL < FIFO < LRU

OPTIMAL = LRU

OPTIMAL = FIFO

Share your thoughts in the comments