Skills101
← All practice quizzes

Quiz: Page Replacement Numericals

5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass

Solve any page replacement question with confidence. A 20-reference string worked with FIFO, LRU and Optimal, a Python simulator to check your answer, the Clock (second-chance) algorithm, how faults change with more frames, and quick shortcuts.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    A reference string touches 9 different pages and memory starts empty. What is the minimum number of page faults with any policy?

  2. Question 2

    In FIFO, what happens to the page order when a reference is a hit?

  3. Question 3

    Frames hold {4, 7, 2} and page 1 causes a fault. The references after it are 2, 7, 4. Which page does OPT replace?

  4. Question 4

    On the 20-reference string with 3 frames, how many faults did OPT give?

  5. Question 5

    Why can't a real operating system use the Optimal algorithm?

🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →