QuizzesPage Replacement Algorithms — Concept Check
intermediate
operating-systems

Page Replacement Algorithms — Concept Check

Questions on Page Replacement Algorithms. When physical memory is full and a page fault occurs, the OS uses a page replacement algorithm to evict a victim page — FIFO, Optimal, LRU, and the Clock algorithm offer different trade-offs.

7 minutes 7 questions Pass at 70%
Time Limit
7 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

7 questions on Page Replacement Algorithms — Concept Check. Work through them here, then start the quiz to answer them and see your score.

  1. 1.A system with 3 frames uses FIFO page replacement. The reference string is 1,2,3,4,1,2,5,1,2,3,4,5. How many page faults occur?

    • A9
    • B7
    • C8
    • D10
  2. 2.In a system using LRU with 3 frames, the reference string is 1,2,3,4,1,2,5,1,2,3,4,5. What is the page fault count?

    • A7
    • B8
    • C9
    • D10
  3. 3.A developer claims that the Optimal algorithm can be implemented with current technology. What is the flaw in this claim?

    • AIt uses too much memory
    • BIt is too slow
    • CIt requires future knowledge
    • DIt is not accurate
  4. 4.A system using the Clock algorithm shows high page fault rates. What might be the issue?

    • AToo many dirty pages
    • BIncorrect reference bit handling
    • CInsufficient frames
    • DBelady's anomaly
  5. 5.Why might FIFO cause more page faults if more frames are added?

    • ABelady's anomaly
    • BClock algorithm issue
    • CLRU effect
    • DOptimal condition
  6. 6.A system using LRU has high overhead. What could be the reason?

    • AToo many frames
    • BTracking usage history
    • CFrequent page faults
    • DHigh swap space usage
  7. 7.A system with 3 frames uses Optimal replacement. The reference string is 1,2,3,4,1,2,5,1,2,3,4,5. How many page faults occur?

    • A6
    • B8
    • C9
    • D7