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

A. Local
B. Universal
C. Global
D. Public

_________ 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.

A. Local
B. Universal
C. Global
D. Public

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

A. Greater than
B. Same as
C. Lesser than
D. None of the mentioned

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

A. Proportional allocation algorithm
B. Equal allocation algorithm
C. Split allocation algorithm
D. None of the mentioned

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

A. Proportional allocation algorithm
B. Equal allocation algorithm
C. Split allocation algorithm
D. None of the mentioned

The maximum number of frames per process is defined by ____________

A. The amount of available physical memory
B. Operating system
C. Instruction set architecture
D. None of the mentioned

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

A. One
B. Two
C. Three
D. None of the mentioned

When a page fault occurs before an executing instruction is complete if ____________

A. The instruction must be restarted
B. The instruction must be ignored
C. The instruction must be completed ignoring the page fault
D. None of the mentioned

The minimum number of frames to be allocated to a process is decided by the ____________

A. The amount of available physical memory
B. Operating system
C. Instruction set architecture
D. None of the mentioned

The implementation of the LFU and the MFU algorithm is very uncommon because ____________

A. They are too complicated
B. They are optimal
C. They are expensive
D. All of the mentioned