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 Internal store of 3 frames is?

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

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

• A. Lru
• B. Lfu
• C. Fifo
• D. None of these

Users are ……. that their processes are running on a paged system?

• A. Aware
• B. Unaware
• C. Informed
• D. None of these

The aim of creating page replacement algorithms is to?

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

A FIFO replacement algorithm associates with each page the?

• A. Time it was brought into memory
• B. Size of the page in memory
• C. Page after and before it
• D. All of these

Optimal page …….. replacement algorithm?

• A. Replace the page that has not been used for a long lime
• 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 these

The optimal page-replacement algorithm is difficult to implement, because?

• A. It requires a lot of information
• B. It requires future knowledge of the reference string
• C. It is too complex
• D. It is extremely expensive

LRU page – replacement algorithm associates with each page the …….?

• A. Time it was brought into memory
• B. The time of that pages last use
• C. Page after and before it
• D. All of these

For 3-page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1; How many page faults does the LRU page replacement algorithm produce?

• A. 10
• B. 15
• C. 11
• D. 12

CPU fetches the instruction from memory according to the value of?

• A. Program counter
• B. Status register
• C. Instruction register
• D. Program status word