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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Optimal page – replacement algorithm is :

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The minimum number of frames to be allocated to a process is decided by the :

View solution

Q. When a page fault occurs before an executing instruction is complete :

View solution

Q. Consider a machine in which all memory reference instructions have only one memory address, for them we need atleast _____ frame(s).

View solution