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

Because of virtual memory, the memory can be shared among ____________

• A. Processes
• B. Threads
• C. Instructions
• D. None of the mentioned

_____ is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.

• A. Paging
• B. Demand paging
• C. Segmentation
• D. Swapping

The pager concerns with the ____________

• A. Individual page of a process
• B. Entire process
• C. Entire thread
• D. First page of a process

Swap space exists in ____________

• A. Primary memory
• B. Secondary memory
• C. Cpu
• D. None of the mentioned

Effective access time is directly proportional to ____________

• A. Page-fault rate
• B. Hit ratio
• C. Memory access time
• D. None of the mentioned

In FIFO page replacement algorithm, when a page must be replaced ____________

• A. Oldest page is chosen
• B. Newest page is chosen
• C. Random page is chosen
• D. None of the mentioned

Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?

• A. First in first out algorithm
• B. Additional reference bit algorithm
• C. Least recently used algorithm
• D. Counting based page replacement algorithm

A process is thrashing if ____________

• A. It spends a lot of time executing, rather than paging
• B. It spends a lot of time paging than executing
• C. It has no memory allocated to it
• D. None of the mentioned

Working set model for page replacement is based on the assumption of ____________

• A. Modularity
• B. Locality
• C. Globalization
• D. Random access