← Back to 9. Virtual Memory

📝 Counting based page replacement

📖 From Operating System • 9. Virtual Memory • 8 questions available

Practice MCQs for Counting based page replacement. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-26

2
Easy Questions
4
Medium Questions
2
Hard Questions

📝 Sample Questions

Q1. What type of page-replacement algorithm selects the page with the smallest reference count for eviction?

🔹 A. Least Recently Used
🔹 B. First-In First-Out
🔹 C. Least Frequently Used
🔹 D. Clock

💡 Difficulty: easy | ✅ Correct: C

Q2. A system tracks page reference counts over the last 1,000 accesses. Page X has count 5, Page Y count 20, and Page Z count 2. A new page must be loaded. Which page should be evicted under a counting-based algorithm?

🔹 A. Page X
🔹 B. Page Y
🔹 C. Page Z
🔹 D. No eviction needed

💡 Difficulty: medium | ✅ Correct: C

Q3. How can a counting-based replacement algorithm cause cache pollution when a page receives many accesses in a short burst and then becomes idle?

🔹 A. Counters retain high values after the burst
🔹 B. Counters are reset too frequently
🔹 C. It treats all accesses equally
🔹 D. It only tracks recency

💡 Difficulty: hard | ✅ Correct: A

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Basic concepts of Demand Paging📝 Performance of demand paging📝 Copy on Write in virtual Memory📝 Basic page replacement in virtual Memory📝 FIFO page replacement
🚀 Start Quiz 📝 Practice Mode