Q42

MCQ2 marks, −0.67

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

(A)

$\text{OPTIMAL} < \text{LRU} < \text{FIFO}$

(B)

$\text{OPTIMAL} < \text{FIFO} < \text{LRU}$

(C)

$\text{OPTIMAL} = \text{LRU}$

(D)

$\text{OPTIMAL} = \text{FIFO}$

Loading…