🎓 BookMCQ
← Back to Operating System

📖 9. Virtual Memory

📖 From Operating System • 386 questions available

About 9. Virtual Memory

Virtual memory is a fantastic trick that makes your computer think it has much more memory (RAM) than it actually does. It does this by using a portion of your hard drive or SSD as an extension of the main memory. This "virtual" space allows programs that are larger than the available RAM to still run, and it lets you run many more programs at once. It's like an overflow area for your workspace, allowing you to work on a huge project even if your desk (RAM) is small.

The magic of virtual memory works through a technique called "demand paging." Instead of loading an entire program into RAM all at once, the OS only loads the pages that are currently needed. If a program needs a page that isn't in RAM, the OS brings it in from the virtual memory on the disk. If RAM gets full, the OS moves some less-used pages back to the disk. This entire process is hidden from the user and the program, making it seem like there is an unlimited supply of fast memory, which is essential for modern multitasking.


Practice MCQs for 9. Virtual Memory. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-26

82
Easy
180
Medium
124
Hard

📌 Topics in this Chapter

Applications and page replacement
8 MCQsView →
Basic concepts of Demand Paging
23 MCQsView →
Basic mechanism of Memory Mapped Files
21 MCQsView →
Basic page replacement in virtual Memory
22 MCQsView →
Buddy system in Allocating Kernel Memory
11 MCQsView →
Cause of thrashing in Operating System
13 MCQsView →
Copy on Write in virtual Memory
12 MCQsView →
Counting based page replacement
8 MCQsView →
FIFO page replacement
11 MCQsView →
Frames Allocation algorithms
9 MCQsView →
Global versus local frames allocation
9 MCQsView →
I/O interlock and page locking
14 MCQsView →
Inverted page tables in Virtual Memory
8 MCQsView →
LRU approximation page replacement
21 MCQsView →
LRU page replacement
18 MCQsView →
Memory mapped I/O
10 MCQsView →
Minimum number of frames in Allocation of Frames
11 MCQsView →
Non uniform memory access in frame allocation
10 MCQsView →
Optimal page replacement
9 MCQsView →
Page buffering algorithms
9 MCQsView →
Page fault frequency in thrashing
8 MCQsView →
Page size in Virtual Memory
11 MCQsView →
Performance of demand paging
18 MCQsView →
Prepaging in Virtual Memory
8 MCQsView →
Program structure in Virtual Memory
11 MCQsView →
Shared memory in the Windows API
18 MCQsView →
Slab allocation in Kernel Memory
15 MCQsView →
TLB reach in Virtual Memory
9 MCQsView →
Virtual Memory examples in Solaris
12 MCQsView →
Virtual Memory examples in Windows
8 MCQsView →
Working set model of thrashing
11 MCQsView →