Locality of reference implies that the page reference being made by a process ____________
A. Will always be to the page used in the previous page reference
B. Is likely to be one of the pages used in the last few page references
C. Will always be one of the pages existing in memory
D. Will always lead to page faults
When the page fault rate is low ____________
A. The turnaround time increases
B. The effective access time increases
C. The effective access time decreases
D. Turnaround time & effective access time increases
When a process begins execution with no pages in memory?
A. Process execution becomes impossible
B. A page fault occurs for every page brought into memory
C. Process causes system crash
D. None of the mentioned
A page fault occurs when?
A. A page gives inconsistent data
B. A page cannot be accessed due to its absence from memory
C. A page is invisible
D. All of the mentioned
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
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
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
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