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

Q. ________ replacement generally results in greater system throughput.

View solution

Q. A process is thrashing if :

View solution

Q. Thrashing _______ the CPU utilization.

View solution

Q. A locality is :

View solution

Q. When a subroutine is called,

View solution

Q. A program is generally composed of several different localities, which _____ overlap.

View solution

Q. The accuracy of the working set depends on the selection of :

View solution

Q. If working set window is too small :

View solution

Q. If working set window is too large :

View solution