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

Q. The maximum number of frames per process is defined by :

View solution

Q. The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as :

View solution

Q. The algorithm in which we allocate memory to each process according to its size is known as :

View solution

Q. With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.

View solution

Q. _________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.

View solution

Q. _________ replacement allows each process to only select from its own set of allocated frames.

View solution

Q. One problem with the global replacement algorithm is that :

View solution