Data-Structures
March 5, 2024Operating-Systems
March 5, 2024GATE 1994
| Question 13 |
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when
| LRU page replacement algorithm is used | |
| FIFO page replacement algorithm is used | |
| LFU page replacement algorithm is used | |
| None of the above |
Question 13 Explanation:
In FIFO, whichever comes first that can be removed first. If the variable was initialized very early, it is in set of first pages. So it was removed.
In LRU which can eliminate (or) removed which is least recently used.
In LFU the frequency of the page is more. So it is in constant use so cannot be replaced.
In LRU which can eliminate (or) removed which is least recently used.
In LFU the frequency of the page is more. So it is in constant use so cannot be replaced.
Correct Answer: B
Question 13 Explanation:
In FIFO, whichever comes first that can be removed first. If the variable was initialized very early, it is in set of first pages. So it was removed.
In LRU which can eliminate (or) removed which is least recently used.
In LFU the frequency of the page is more. So it is in constant use so cannot be replaced.
In LRU which can eliminate (or) removed which is least recently used.
In LFU the frequency of the page is more. So it is in constant use so cannot be replaced.
Subscribe
Login
0 Comments