🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: Page Replacement Numericals: questions with answers

15 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. A reference string touches 9 different pages and memory starts empty. What is the minimum number of page faults with any policy?
  2. Q2. In FIFO, what happens to the page order when a reference is a hit?
  3. Q3. 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. Q4. On the 20-reference string with 3 frames, how many faults did OPT give?
  5. Q5. Why can't a real operating system use the Optimal algorithm?
  6. Q6. Which algorithm can show Belady's anomaly?
  7. Q7. In the Clock algorithm, the hand reaches a frame whose reference bit is 1. What happens?
  8. Q8. What does this print? (code)
  9. Q9. 20 references cause 15 faults. What is the hit ratio?
  10. Q10. In the simulator, why does the LRU branch remove a page and append it again on a hit?
  11. Q11. Using the lesson's 20-reference string with 4 frames, how many faults does LRU give?
  12. Q12. With 5 frames, OPT gives 7 faults on the 20-reference string. What is the hit ratio?
  13. Q13. A string of 12 references, where no page repeats immediately, runs with only 1 frame. How many page faults occur?
  14. Q14. What does this print? (code)
  15. Q15. Why can LRU never show Belady's anomaly?