adplus-dvertising
frame-decoration

Question

Locality of reference implies that the page reference being made by a process :

a.

will always be to the page used in the previous page reference

b.

is likely to be one of the pages used in the last few page references

c.

will always be one of the pages existing in memory

d.

will always lead to page faults

Posted under Operating System

Answer: (b).is likely to be one of the pages used in the last few page references

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Locality of reference implies that the page reference being made by a process :

Similar Questions

Discover Related MCQs

Q. Which of the following page replacement algorithms suffers from Belady’s Anomaly ?

Q. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is :

Q. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is :

Q. Users _______ that their processes are running on a paged system.

Q. If no frames are free, _____ page transfer(s) is/are required.

Q. When a page is selected for replacement, and its modify bit is set :

Q. The aim of creating page replacement algorithms is to :

Q. A FIFO replacement algorithm associates with each page the _______

Q. Optimal page – replacement algorithm is :

Q. Optimal page – replacement algorithm is difficult to implement, because :

Q. LRU page – replacement algorithm associates with each page the ______

Q. The two methods how LRU page replacement policy can be implemented in hardware are:

Q. When using counters to implement LRU, we replace the page with the :

Q. In the stack implementation of the LRU algorithm, a stack can be maintained in a manner :

Q. There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called :

Q. The essential content(s) in each entry of a page table is / are :

Q. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by :

Q. The reason for using the LFU page replacement algorithm is :

Q. The reason for using the MFU page replacement algorithm is :

Q. The implementation of the LFU and the MFU algorithm is very uncommon because :