1.6k views

Consider the virtual page reference string

$\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$

on a demand paged virtual memory system running on a computer system that has main memory size of $3$ page frames which are initially empty. Let $\text{LRU}$, $\text{FIFO}$ and $\text{OPTIMAL}$ denote the number of page faults under the corresponding page replacement policy. Then

1. $\text{OPTIMAL} < \text{LRU} < \text{FIFO}$
2. $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$
3. $\text{OPTIMAL} = \text{LRU}$
4. $\text{OPTIMAL} = \text{FIFO}$
edited | 1.6k views

Page fault for LRU $=9$, FIFO $=6$, OPTIMAL $=5$

edited by
+1

Option :- B