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
This question is part of this quiz :
GATE CS 2012,OS Memory Management,Operating system GATE CS PYQ QUIZ,Memory Management GATE CS PYQ Quiz