Which of the following page replacement algorithms suffers from Belady’s Anomaly?

• A. Optimal replacement
• B. Lru
• C. Fifo
• D. Both optimal replacement and fifo

A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is?

• A. 8
• B. 10
• C. 9
• D. 7

A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers ____________

• A. Decreases
• B. Increases
• C. Remains the same
• D. None of the mentioned

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________

• A. Lru
• B. Lfu
• C. Fifo
• D. None of the mentioned

A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements. P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE?

• A. Both p and q are true, and q is the reason for p
• B. Both p and q are true, but q is not the reason for p
• C. P is false but q is true
• D. Both p and q are false

Users _______ that their processes are running on a paged system.

• A. Are aware
• B. Are unaware
• C. May unaware
• D. None of the mentioned

If no frames are free, _____ page transfer(s) is/are required.

• A. One
• B. Two
• C. Three
• D. Four

When a page is selected for replacement, and its modify bit is set ____________

• A. The page is clean
• B. The page has been modified since it was read in from the disk
• C. The page is dirty
• D. The page has been modified since it was read in from the disk & page is dirty

The aim of creating page replacement algorithms is to ____________

• A. Replace pages faster
• B. Increase the page fault rate
• C. Decrease the page fault rate
• D. To allocate multiple pages to processes

What is the Optimal page – replacement algorithm?

• A. Replace the page that has not been used for a long time
• B. Replace the page that has been used for a long time
• C. Replace the page that will not be used for a long time
• D. None of the mentioned