Demand Paging and Page Replacement

__________ has the lowest fault rate of all the page replacement algorithms.

• LRU

• FIFO

• Optimal

• Counting based

In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?

• oldest

• newest

• Frequently occurred page in the future

• Not Frequently occurred page in the future

Which algorithm suffers from Belady's anomaly?

• FIFO

• Optimal

• LRU

• All of these

Replace the page that is not used for the longest period of time. This principle is adopted by ____________.

• LRU

• FIFO

• MFU

• LFU

A page fault occurs

• when the process enters the ready state

• when the process enters the blocked state

• when the page is in the memory

• when the page is not in the memory

Operating system supports different page replacement algorithms. From the given below option which is not a valid one?

• Optimal

• Currently used

• LRU

• FIFO

The least frequently used page replacement algorithm will select the page that

• has been used for the longest time in the past.

• has been used most number of times.

• will not be used for the longest time in future.

• has been used least number of times.

with demand paging a page of a process is brought into the main memory ...

• when the execution of a process starts

• when the process comes to the ready queue

• when the page is required during execution

• never bring a page to main memory

The valid/ invalid bit in the page table is set if

• the page is present in the main memory

• the page is not present in the main memory

• page is not required

• page is required

Virtual Memory can be implemented via

• Paging

• Segmentation

• Segmentation with paging

• demand paging