Virtual Memory Demand Paging MCQs

16 MCQs — Operating System MCQs (Page 1 of 2)

Practice Virtual Memory Demand Paging MCQs with correct answers and explanations. These questions are from the Operating System MCQs section.

Attempt Virtual Memory Demand Paging Quiz

Operating System Subcategories

Application Io Interface 1	Application Io Interface 2
Atomic Transactions	Basics
Classic Sync Problems	Communication Systems Bandwidth Transmission Medium
Cpu Scheduling	Cpu Scheduling 2
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Cpu Scheduling Benefits	Critical Section Problem
Deadlock	Deadlock Avoidance
Deadlock Detection	Deadlock Prevention
Deadlock Recovery	Disk Management
Disk Scheduling 1	Disk Scheduling 2
Distributed File System	Distributed Operating System
Distributed Synchronization	File System 1
File System Allocation Methods 1	File System Allocation Methods 2
File System Allocation Methods 3	File System Concepts
File System Free Space Performance	File System Implementation
File System Interface Access Methods 1	File System Interface Access Methods 2
File System Interface Directory Structure 1	File System Interface Directory Structure 2
File System Interface Mounting Sharing	File System Interface Protection
File System Recovery	Inter Process Communication
Io Subsystem	Kernel Io Subsystems
Linux	Mass Storage Raid 1
Mass Storage Raid 2	Mass Storage Tertiary Storage
Memory Allocation 1	Memory Allocation 2
Memory Management	Memory Management Paging 1
Memory Management Paging 2	Memory Management Segmentation
Memory Management Swapping 1	Memory Management Swapping 2
Multi Threading Models	Multimedia System Compression 1
Multimedia System Compression 2	Multimedia System Compression 3
Multimedia System Cpu Disk Scheduling	Multimedia System Network Management
Network File System 1	Network File System 2
Network Structure Topology	Operating System
Process Control Block	Process Creation
Process Rpc	Process Scheduling Queue
Process Structures	Process Sync Monitors
Process Synchronization	Processes
Protection Access Matrix	Protection Concepts
Protection Memory Protection	Protection Revocation Access Rights
Robustness	Rtos
Secondary Storage	Security
Security Cryptography	Security Intrusion Detection
Security Program System Threats	Security System Facility
Security User Authentication	Semaphores 1
Semaphores 2	Swap Space Management
Threads	Threads Cancellation
Threads Fork Exec	Threads Pools
Threads Signal Handling	Threads Ult Klt
Two Port Network	Virtual Memory
Virtual Memory Demand Paging	Virtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1	Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing

Virtual memory allows ____________

A. Execution of a process that may not be completely in memory
B. A program to be smaller than the physical memory
C. A program to be larger than the secondary storage
D. Execution of a process without being in physical memory

Read more about this MCQ

The instruction being executed, must be in ____________

A. Physical memory
B. Logical memory
C. Physical & logical memory
D. None of the mentioned

Read more about this MCQ

Error handler codes, to handle unusual errors are ____________

A. Almost never executed
B. Executed very often
C. Executed periodically
D. None of the mentioned

Read more about this MCQ

The ability to execute a program that is only partially in memory has benefits like ____________

A. The amount of physical memory cannot put a constraint on the program
B. Programs for an extremely large virtual space can be created
C. Throughput increases
D. All of the mentioned

Read more about this MCQ

In virtual memory. the programmer __________ of overlays.

A. Has to take care
B. Does not have to take care
C. All of the mentioned
D. None of the mentioned

Read more about this MCQ

Virtual memory is normally implemented by ________

A. Demand paging
B. Buses
C. Virtualization
D. All of the mentioned

Read more about this MCQ

Segment replacement algorithms are more complex than page replacement algorithms because ____________

A. Segments are better than pages
B. Pages are better than segments
C. Segments have variable sizes
D. Segments have fixed sizes

Read more about this MCQ

A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process.

A. The entire process, parts
B. All the pages of a process, segments
C. The entire process, pages
D. None of the mentioned

Read more about this MCQ

Using a pager ____________

A. Increases the swap time
B. Decreases the swap time
C. Decreases the swap time & amount of physical memory needed
D. Increases the amount of physical memory needed

Read more about this MCQ

The valid – invalid bit, in this case, when valid indicates?

A. The page is not legal
B. The page is illegal
C. The page is in memory
D. The page is not in memory

Read more about this MCQ

MCQs Menu

Past Papers