Virtual Memory MCQs

9 MCQs — Operating System MCQs

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

Attempt Virtual Memory 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

Because of virtual memory, the memory can be shared among ____________

A. Processes
B. Threads
C. Instructions
D. None of the mentioned

Read more about this MCQ

_____ is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.

A. Paging
B. Demand paging
C. Segmentation
D. Swapping

Read more about this MCQ

The pager concerns with the ____________

A. Individual page of a process
B. Entire process
C. Entire thread
D. First page of a process

Read more about this MCQ

Swap space exists in ____________

A. Primary memory
B. Secondary memory
C. Cpu
D. None of the mentioned

Read more about this MCQ

When a program tries to access a page that is mapped in address space but not loaded in physical memory, then ____________

A. Segmentation fault occurs
B. Fatal error occurs
C. Page fault occurs
D. No error occurs

Read more about this MCQ

Effective access time is directly proportional to ____________

A. Page-fault rate
B. Hit ratio
C. Memory access time
D. None of the mentioned

Read more about this MCQ

In FIFO page replacement algorithm, when a page must be replaced ____________

A. Oldest page is chosen
B. Newest page is chosen
C. Random page is chosen
D. None of the mentioned

Read more about this MCQ

Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?

A. First in first out algorithm
B. Additional reference bit algorithm
C. Least recently used algorithm
D. Counting based page replacement algorithm

Read more about this MCQ

Working set model for page replacement is based on the assumption of ____________

A. Modularity
B. Locality
C. Globalization
D. Random access

Read more about this MCQ

MCQs Menu

Past Papers