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

📝 Optimal page replacement

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

Practice MCQs for Optimal 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
3
Hard Questions

📝 Sample Questions

Q1. A program accesses pages in the order 1,2,3,4,1,2,5,1,2,3,4,5 and the system has three page frames. Using the optimal page‑replacement algorithm, how many page faults occur?

🔹 A. 6
🔹 B. 7
🔹 C. 8
🔹 D. 9

💡 Difficulty: easy | ✅ Correct: B

Q2. What is the definition of the optimal page‑replacement algorithm in demand‑paging systems?

🔹 A. Replace the page that has been in memory the longest.
🔹 B. Replace the page whose next reference occurs farthest in the future.
🔹 C. Replace a randomly chosen page.
🔹 D. Replace the page with the smallest page number.

💡 Difficulty: medium | ✅ Correct: B

Q3. A workload causes 15 page faults under the optimal algorithm and 25 faults under FIFO. If each page‑in from disk takes 10 ms, what is the total reduction in swap‑in time (in milliseconds) when using the optimal algorithm?

🔹 A. 50
🔹 B. 75
🔹 C. 100
🔹 D. 125

💡 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