Page Replacement Algorithms MCQ

Test your knowledge with important Page Replacement Algorithms MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Page Replacement Algorithms MCQs at Bissoy

• The implementation of the LFU and the MFU algorithm is very uncommon because ____________
  ক

  they are too complicated

  খ

  they are optimal

  গ

  they are expensive

  ঘ

  all of the mentioned
• What is the reason for using the MFU page replacement algorithm?
  ক

  an actively used page should have a large reference count

  খ

  a less used page has more chances to be used again

  গ

  it is extremely efficient and optimal

  ঘ

  all of the mentioned
• What is the reason for using the LFU page replacement algorithm?
  ক

  an actively used page should have a large reference count

  খ

  a less used page has more chances to be used again

  গ

  it is extremely efficient and optimal

  ঘ

  all of the mentioned
• The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by ____________
  ক

  the instruction set architecture

  খ

  page size

  গ

  physical memory size

  ঘ

  number of processes in memory
• The essential content(s) in each entry of a page table is/are ____________
  ক

  Virtual page number

  খ

  Page frame number

  গ

  Both virtual page number and page frame number

  ঘ

  Access right information
• Increasing the RAM of a computer typically improves performance because ____________
  ক

  Virtual memory increases

  খ

  Larger RAMs are faster

  গ

  Fewer page faults occur

  ঘ

  None of the mentioned
• Applying the LRU page replacement to the following reference string. 1 2 4 5 2 1 2 4 The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2. How many page faults will occur?
  ক

  2

  খ

  3

  গ

  4

  ঘ

  5
• There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________
  ক

  queue algorithms

  খ

  stack algorithms

  গ

  string algorithms

  ঘ

  none of the mentioned
• In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________
  ক

  whenever a page is used, it is removed from the stack and put on bottom

  খ

  the bottom of the stack is the LRU page

  গ

  the top of the stack contains the LRU page and all new pages are added to the top

  ঘ

  none of the mentioned
• When using counters to implement LRU, we replace the page with the ____________
  ক

  smallest time value

  খ

  largest time value

  গ

  greatest size

  ঘ

  none of the mentioned
• What are the two methods of the LRU page replacement policy that can be implemented in hardware?
  ক

  Counters

  খ

  RAM & Registers

  গ

  Stack & Counters

  ঘ

  Registers
• 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?
  ক

  10

  খ

  15

  গ

  11

  ঘ

  12
• LRU page – replacement algorithm associates with each page the ______
  ক

  time it was brought into memory

  খ

  the time of that page’s last use

  গ

  page after and before it

  ঘ

  all of the mentioned
• Optimal page – replacement algorithm is difficult to implement, because ____________
  ক

  it requires a lot of information

  খ

  it requires future knowledge of the reference string

  গ

  it is too complex

  ঘ

  it is extremely expensive
• What is the Optimal page – replacement algorithm?
  ক

  Replace the page that has not been used for a long time

  খ

  Replace the page that has been used for a long time

  গ

  Replace the page that will not be used for a long time

  ঘ

  None of the mentioned
• A FIFO replacement algorithm associates with each page the _______
  ক

  time it was brought into memory

  খ

  size of the page in memory

  গ

  page after and before it

  ঘ

  all of the mentioned
• The aim of creating page replacement algorithms is to ____________
  ক

  replace pages faster

  খ

  increase the page fault rate

  গ

  decrease the page fault rate

  ঘ

  to allocate multiple pages to processes
• When a page is selected for replacement, and its modify bit is set ____________
  ক

  the page is clean

  খ

  the page has been modified since it was read in from the disk

  গ

  the page is dirty

  ঘ

  the page has been modified since it was read in from the disk & page is dirty
• If no frames are free, _____ page transfer(s) is/are required.
  ক

  one

  খ

  two

  গ

  three

  ঘ

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

  are aware

  খ

  are unaware

  গ

  may unaware

  ঘ

  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?
  ক

  Both P and Q are true, and Q is the reason for P

  খ

  Both P and Q are true, but Q is not the reason for P

  গ

  P is false but Q is true

  ঘ

  Both P and Q are false
• 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 ____________
  ক

  LRU

  খ

  LFU

  গ

  FIFO

  ঘ

  None of the mentioned
• 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 ____________
  ক

  decreases

  খ

  increases

  গ

  remains the same

  ঘ

  none of the mentioned
• 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?
  ক

  8

  খ

  10

  গ

  9

  ঘ

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

  Optimal replacement

  খ

  LRU

  গ

  FIFO

  ঘ

  Both optimal replacement and FIFO