🏠 Home > Operating System > 9. Virtual Memory > LRU page replacement
← Back to 9. Virtual Memory

📝 LRU page replacement

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

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

🔄 Last updated: 2026-07-26

4
Easy Questions
9
Medium Questions
5
Hard Questions

📝 Sample Questions

Q1. What does LRU stand for in page replacement algorithms?

🔹 A. Least Recently Used
🔹 B. Longest Runtime Utilization
🔹 C. Linear Resource Unit
🔹 D. Local Reference Update

💡 Difficulty: easy | ✅ Correct: A

Q2. In the valid‑invalid bit scheme, what does a valid bit indicate?

🔹 A. The page is currently resident in main memory
🔹 B. The page resides on disk
🔹 C. The page is illegal in the process address space
🔹 D. The page is write‑protected

💡 Difficulty: medium | ✅ Correct: A

Q3. Which statement best describes the relationship between LRU and the Clock (second‑chance) algorithm?

🔹 A. Clock approximates LRU by giving each page a second chance using a reference bit, sacrificing exact ordering for lower overhead
🔹 B. Clock implements true LRU by maintaining a full stack of pages
🔹 C. Clock always evicts the most recently used page, opposite of LRU
🔹 D. Clock cannot be used for page replacement at all

💡 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