📝 Inverted page tables in Virtual Memory

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

Practice MCQs for Inverted page tables 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. A system uses an inverted page table that stores one entry per physical frame. When a process requests a virtual address, the OS must locate the corresponding frame. Which method is most efficient for finding the frame entry?

🔹 A. Scan the entire table sequentially

🔹 B. Apply a hash function to the (process‑ID, page‑number) pair

🔹 C. Maintain a separate per‑process page table

🔹 D. Use a binary‑search tree keyed by virtual page numbers

💡 Difficulty: easy | ✅ Correct: A

Q2. Why does an inverted page table typically use less memory than separate conventional page tables for many processes?

🔹 A. It stores one entry per physical frame rather than per virtual page

🔹 B. It compresses page numbers into shorter codes

🔹 C. It eliminates the need for valid‑bit flags

🔹 D. It reuses entries for shared libraries

💡 Difficulty: medium | ✅ Correct: B

Q3. A system suffers a high page‑fault rate. Which combination is most likely to lower the fault rate while keeping memory overhead reasonable?

🔹 A. Switch to an inverted page table without any cache

🔹 B. Use an inverted page table together with a translation look‑aside buffer (TLB)

🔹 C. Replace the inverted page table with a conventional table and increase page size

🔹 D. Adopt an inverted page table with double‑hashing but no TLB

💡 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