📝 Basic page replacement in virtual Memory

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

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

🔄 Last updated: 2026-07-26

Easy Questions

Medium Questions

Hard Questions

📝 Sample Questions

Q1. What does the valid bit indicate in a page‑table entry?

🔹 A. The page is currently resident in physical memory

🔹 B. The page resides on secondary storage

🔹 C. The page is read‑only

🔹 D. The page is write‑protected

💡 Difficulty: easy | ✅ Correct: A

Q2. Why does a lazy swapper improve system performance compared to swapping whole processes?

🔹 A. It brings in only pages that will actually be used

🔹 B. It reduces CPU scheduling overhead

🔹 C. It eliminates the need for page tables

🔹 D. It guarantees zero page faults

💡 Difficulty: medium | ✅ Correct: A

Q3. Explain why marking a page‑table entry as invalid can represent both an illegal address and a page residing on disk, and how the system distinguishes the two cases.

🔹 A. Invalid always means illegal address; disk pages are never marked invalid

🔹 B. The OS stores a secondary flag indicating whether the invalid page is on disk

🔹 C. The hardware raises a different exception for illegal addresses

🔹 D. The page‑table entry includes a pointer to the disk block when invalid

💡 Difficulty: hard | ✅ Correct: C

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Basic concepts of Demand Paging 📝 Performance of demand paging 📝 Copy on Write in virtual Memory 📝 FIFO page replacement 📝 Optimal page replacement

🚀 Start Quiz 📝 Practice Mode