How many page fault will occur with the following string:
1, 2, 3, 4, 5, 3, 4, 2, 6, 7, 9, 8, 2, 3, 4 With least frequently used page replacement policy and 4-page frames?

(A) 10
(B) 11
(C) 12
(D) 13


Answer: (A)

Explanation: Sol’n- Given string is 1, 2, 3, 4, 5, 3, 4, 2, 6, 7, 9, 8, 2, 3, 4 number of page frame = 4.
\"\"
Firstly we will fill all the frames then replacement of page will be according to least frequency
Which is given below. When pages have same frequency then it will act like FIFO.
Page -> frequency
1 = 1
2 = 1
= 2
= 3
3 = 1
= 2
= 3
4 = 1
= 2
5 = 1
6 = 1
7 = 1
8 = 1
9 = 1
There are total 10 page fault
Option (A) is correct.


Quiz of this Question


  • Last Updated : 22 Nov, 2018

Share your thoughts in the comments