โ† Back to 9. Virtual Memory

๐Ÿ“ Program structure in Virtual Memory

๐Ÿ“– From Operating System โ€ข 9. Virtual Memory โ€ข 11 questions available

Practice MCQs for Program structure in Virtual Memory. 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
5
Hard Questions

๐Ÿ“ Sample Questions

Q1. A system reserves a fixed 20โ€ฏ% of its memory for I/O buffers. When a running process causes a page fault and the freeโ€‘frame list is empty, which action should the operating system take first?

๐Ÿ”น A. Terminate the process immediately
๐Ÿ”น B. Swap out an entire process to free all its frames
๐Ÿ”น C. Perform page replacement to free a single frame
๐Ÿ”น D. Increase the size of the I/O buffer pool

๐Ÿ’ก Difficulty: easy | โœ… Correct: C

Q2. In a multitasking environment where many processes generate frequent page faults, which replacement strategy typically reduces thrashing the most?

๐Ÿ”น A. Firstโ€‘Inโ€‘Firstโ€‘Out (FIFO)
๐Ÿ”น B. Optimal (theoretical) algorithm
๐Ÿ”น C. Leastโ€‘Recentlyโ€‘Used (LRU)
๐Ÿ”น D. Random replacement

๐Ÿ’ก Difficulty: medium | โœ… Correct: C

Q3. If a system keeps a fixed 15โ€ฏ% of memory for I/O buffers and suddenly experiences heavy I/O activity, which policy would most effectively prevent excessive swapping of user processes?

๐Ÿ”น A. Dynamically increase the memory portion reserved for I/O buffers
๐Ÿ”น B. Maintain the fixed 15โ€ฏ% allocation regardless of load
๐Ÿ”น C. Prefetch pages for all active processes
๐Ÿ”น D. Adopt a workingโ€‘set model for each process

๐Ÿ’ก Difficulty: hard | โœ… Correct: B

โฌ†๏ธ 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