โ† Back to 9. Virtual Memory

๐Ÿ“ Slab allocation in Kernel Memory

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

Practice MCQs for Slab allocation in Kernel Memory. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

๐Ÿ”„ Last updated: 2026-07-26

4
Easy Questions
6
Medium Questions
5
Hard Questions

๐Ÿ“ Sample Questions

Q1. A process requests a new stack page and the OS employs zero-fill-on-demand. Which description best matches the resulting physical memory state?

๐Ÿ”น A. The page is copied from an existing page
๐Ÿ”น B. The page is allocated and filled with zeros
๐Ÿ”น C. The page retains data from the previous process
๐Ÿ”น D. The page is left uninitialized

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

Q2. A developer notices that after forking a process, the childโ€™s memory usage spikes unexpectedly. Which scenario most likely explains this behavior?

๐Ÿ”น A. The child writes to many stack pages, triggering copyโ€‘onโ€‘write copies
๐Ÿ”น B. The child immediately executes a different program via exec
๐Ÿ”น C. The parent modifies shared library code
๐Ÿ”น D. The OS uses lazy allocation for all pages

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

Q3. Which statement best describes why zeroโ€‘fillโ€‘onโ€‘demand pages improve security in an OS that uses copyโ€‘onโ€‘write?

๐Ÿ”น A. They prevent accidental overwrites of shared pages
๐Ÿ”น B. They ensure that newly allocated pages contain no residual data
๐Ÿ”น C. They allow pages to be shared without copying
๐Ÿ”น D. They speed up process creation

๐Ÿ’ก 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