📝 Applications and page replacement

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

Practice MCQs for Applications and page replacement. 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. A process currently has only page 2 resident in memory. The next CPU reference is to page 2. What does the lazy swapper do?

🔹 A. It issues a page fault and loads page 2 from disk.

🔹 B. It finds page 2 already valid and continues execution.

🔹 C. It swaps out another page to make room for page 2.

🔹 D. It terminates the process due to invalid reference.

💡 Difficulty: easy | ✅ Correct: B

Q2. What does the “valid” setting of the valid–invalid bit indicate in a page‑table entry?

🔹 A. The page is illegal and cannot be accessed.

🔹 B. The page is currently stored on disk.

🔹 C. The page is legal and present in physical memory.

🔹 D. The page is reserved for future use.

💡 Difficulty: medium | ✅ Correct: C

Q3. If memory access time is 0.1 ms, page‑fault service time is 10 ms, and the page‑fault rate is \(p\), what is the effective access time (EAT) using lazy swapping?

🔹 A. \(EAT = 0.1 + p \times 10\)

🔹 B. \(EAT = 0.1 \times (1-p) + 10 \times p\)

🔹 C. \(EAT = 0.1 \times (1-p) + (0.1 + 10) \times p\)

🔹 D. \(EAT = 10 \times (1-p) + 0.1 \times p\)

💡 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 📝 Basic page replacement in virtual Memory 📝 FIFO page replacement

🚀 Start Quiz 📝 Practice Mode