Operating System » Virtual Memory Demand Paging
Virtual memory allows ____________

A. Execution of a process that may not be completely in memory
B. A program to be smaller than the physical memory
C. A program to be larger than the secondary storage
D. Execution of a process without being in physical memory

The instruction being executed, must be in ____________

A. Physical memory
B. Logical memory
C. Physical & logical memory
D. None of the mentioned

Error handler codes, to handle unusual errors are ____________

A. Almost never executed
B. Executed very often
C. Executed periodically
D. None of the mentioned

The ability to execute a program that is only partially in memory has benefits like ____________

A. The amount of physical memory cannot put a constraint on the program
B. Programs for an extremely large virtual space can be created
C. Throughput increases
D. All of the mentioned

In virtual memory. the programmer __________ of overlays.

A. Has to take care
B. Does not have to take care
C. All of the mentioned
D. None of the mentioned

Virtual memory is normally implemented by ________

A. Demand paging
B. Buses
C. Virtualization
D. All of the mentioned

Segment replacement algorithms are more complex than page replacement algorithms because ____________

A. Segments are better than pages
B. Pages are better than segments
C. Segments have variable sizes
D. Segments have fixed sizes

A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process.

A. The entire process, parts
B. All the pages of a process, segments
C. The entire process, pages
D. None of the mentioned

Using a pager ____________

A. Increases the swap time
B. Decreases the swap time
C. Decreases the swap time & amount of physical memory needed
D. Increases the amount of physical memory needed

The valid – invalid bit, in this case, when valid indicates?

A. The page is not legal
B. The page is illegal
C. The page is in memory
D. The page is not in memory