UGC NET CSE | August 2016 | Part 3 | Question: 52

Question

Consider the following page reference string :

$1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6$ 

Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page replacement algorithms respectively, assuming $05$ page frames and all frames are initially empty ?

• A. $10, 14, 8$
• B. $8, 10, 7$ 
• C. $7, 10, 8$ 
• D. $7, 10, 7$

Answer 1

Refrence string : $1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6$

    

Page-faults $\Rightarrow$  LRU:FIFO:Optimal $= 8:10:7$

Hence, option (B) is Correct

Answer 2

Option B

LRU= 8

FFO = 10

OPTIMAL=7