Page replacement Technique

Question 1
 
A
4
B
5
C
6
D
7
       Operating Systems       Page replacement Technique       Gate 2004-IT
Question 1 Explanation: 
When 45 comes, the cache contents are:
4, 3, 25, 8, 19, 6, 16, 35
CPU array (first element being least recently used)
[4, 3, 19, 6, 25, 8, 16, 35]
So, 45 replaces 4.
45, 3, 25, 8, 19, 6, 16, 35 [3, 19, 6, 25, 8, 16, 35, 45]
Similarly, 22 replaces 3 to give,
45, 22, 25, 8, 19, 6, 16, 35 [19, 6, 25, 8, 16, 35, 45, 22]
8 hits in cache.
45, 22, 25, 8, 19, 6, 16, 35 [19, 6, 25, 16, 35, 45, 22, 8]
3 replaces 19,
45, 22, 25, 8, 3, 6, 16, 35 [6, 25, 16, 35, 45, 22, 8, 3]
16 and 25 hits in cache,
45, 22, 25, 8, 3, 6, 16, 35 [6, 35, 45, 22, 8, 3, 16, 25]
Finally, 7 replaces 6, which is in block 5.
Question 2
Which of the following page replacement algorithms suffers from Belady’s anamoly?
A
Optimal replacement
B
LRU
C
FIFO
D
Both (A) and (C)
       Operating Systems       Page Replacement Technique       Gate-1995
Question 2 Explanation: 
FIFO is suffers from Belady's Anamoly.
Question 3
Which page replacement policy sometimes leads to more page faults when size of memory is increased?
A
FIFO
       Operating Systems       Page Replacement technique       Gate-1992
Question 3 Explanation: 
FIFO, because it sometimes leads to more page faults when size of memory is increased.
There are 3 questions to complete.