1,313 views
0 votes
0 votes

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when
(a) LRU page replacement algorithm is used
(b) FIFO page replacement algorithm is used
(c) LFU page replacement algorithm is used
(d) None of the above

2 Answers

Best answer
7 votes
7 votes

LRU can't be used as the page is still is in use , so it will be in most high priority.

LFU can't be used as it has been accessed several time , it's frequency value will be larger.

FIFO can do it as it only considers the time the page came in RAM. So the page can be deleted by FIFO . also from that statement we can assume FIFO wasn't in use till now.

selected by
2 votes
2 votes

(b) FIFO page replacement algorithm is used
Here, the first IN page is removed when pagetable is full regardless of the usage of the page. 

 

Related questions

0 votes
0 votes
0 answers
1
Jyoti Kumari97 asked Jan 15, 2019
540 views
Assume there are 5 frames and consider the following reference string find the number of page faults using NRU page replacement algorithm.3,2,3, 0,8,4,2,5,0,9,8,3,2
0 votes
0 votes
0 answers
2
Mayankprakash asked Dec 24, 2018
378 views
Do we need to cover page replacement implementations for gate?Please suggest
1 votes
1 votes
2 answers
3
muthu kumar asked Dec 15, 2018
506 views
How the value is 36? im getting 39.
0 votes
0 votes
0 answers
4
Mayankprakash asked Sep 22, 2018
147 views
Do we have to study page replacement algorithm implementation...Is it important for gate?Please suggest