🏠 Home > Operating System > 9. Virtual Memory > Page buffering algorithms
← Back to 9. Virtual Memory

📝 Page buffering algorithms

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

Practice MCQs for Page buffering algorithms. 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
3
Hard Questions

📝 Sample Questions

Q1. Process X requests page 5, which is currently not resident. What does a lazy swapper do in this situation?

🔹 A. Loads page 5 from disk into a free frame
🔹 B. Swaps out another page before loading page 5
🔹 C. Terminates the process
🔹 D. Ignores the request

💡 Difficulty: easy | ✅ Correct: A

Q2. A system with four physical frames holds pages 1, 2, 3, 4 in that order of recent use (page 1 most recent, page 4 least recent). Page 5 is now requested. Using a lazy swapper with LRU replacement, which page will be evicted?

🔹 A. Page 1
🔹 B. Page 2
🔹 C. Page 3
🔹 D. Page 4

💡 Difficulty: medium | ✅ Correct: D

Q3. What does it mean when a page‑table entry's valid bit is set to “valid”?

🔹 A. Valid indicates the page is legal and resident in memory
🔹 B. Valid indicates the page is illegal but on disk
🔹 C. Invalid indicates the page is resident in memory
🔹 D. Valid indicates the page is legal and resident in memory

💡 Difficulty: hard | ✅ Correct: D

⬆️ 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