Skills101
← All practice quizzes

Quiz: Virtual Memory

5 questionsNo time limitPass: 60%+10 XP on first pass

Run programs bigger than RAM. Demand paging, page faults, page replacement algorithms solved step by step (FIFO, LRU, Optimal), Belady's anomaly and thrashing.

Log in to take the quiz

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

  1. Question 1

    Which page replacement algorithm gives the minimum number of page faults?

  2. Question 2

    Belady's anomaly can occur with which algorithm?

  3. Question 3

    With 3 empty frames and the reference string 1, 2, 3, how many page faults occur?

  4. Question 4

    What is thrashing?

  5. Question 5

    LRU replaces the page that: