โ† Back to 9. Virtual Memory

๐Ÿ“ Copy on Write in virtual Memory

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

Practice MCQs for Copy on Write 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
5
Medium Questions
5
Hard Questions

๐Ÿ“ Sample Questions

Q1. What does the term copyโ€‘onโ€‘write (COW) describe in virtual memory management?

๐Ÿ”น A. Immediately duplicating all pages for a new process
๐Ÿ”น B. Sharing pages until a write occurs, then copying
๐Ÿ”น C. Mapping files readโ€‘only only
๐Ÿ”น D. Allocating physical memory for each virtual page

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

Q2. Process A calls fork(), creating Process B. Both have a readโ€‘only mapping of libX.so. Immediately after fork, Process B writes to a global variable in libX. Which mechanism handles the write?

๐Ÿ”น A. Demand paging loads a new copy of the entire library
๐Ÿ”น B. Copyโ€‘onโ€‘write creates a private copy of the modified page
๐Ÿ”น C. The OS swaps out the whole library
๐Ÿ”น D. The write is ignored

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

Q3. A processโ€™s virtual address space has a hole from \(0x60000000\) to \(0x70000000\). The stack grows downwards and currently ends at \(0x60100000\). If the stack expands by \(0x20000\) bytes, which address will cause the first page fault?

๐Ÿ”น A. 1610612736
๐Ÿ”น B. 1609564160
๐Ÿ”น C. 1611661312
๐Ÿ”น D. 1611657216

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

โฌ†๏ธ View all questions in the quiz below

๐Ÿ”— Related Topics

๐Ÿ“ Basic concepts of Demand Paging๐Ÿ“ Performance of demand paging๐Ÿ“ Basic page replacement in virtual Memory๐Ÿ“ FIFO page replacement๐Ÿ“ Optimal page replacement
๐Ÿš€ Start Quiz ๐Ÿ“ Practice Mode