Operating System » Virtual Memory Demand Paging
Operating System Subcategories
Application Io Interface 1Application Io Interface 2
Atomic TransactionsBasics
Classic Sync ProblemsCommunication Systems Bandwidth Transmission Medium
Cpu SchedulingCpu Scheduling 2
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
Cpu Scheduling BenefitsCritical Section Problem
DeadlockDeadlock Avoidance
Deadlock DetectionDeadlock Prevention
Deadlock RecoveryDisk Management
Disk Scheduling 1Disk Scheduling 2
Distributed File SystemDistributed Operating System
Distributed SynchronizationFile System 1
File System Allocation Methods 1File System Allocation Methods 2
File System Allocation Methods 3File System Concepts
File System Free Space PerformanceFile System Implementation
File System Interface Access Methods 1File System Interface Access Methods 2
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Interface Protection
File System RecoveryInter Process Communication
Io SubsystemKernel Io Subsystems
LinuxMass Storage Raid 1
Mass Storage Raid 2Mass Storage Tertiary Storage
Memory Allocation 1Memory Allocation 2
Memory ManagementMemory Management Paging 1
Memory Management Paging 2Memory Management Segmentation
Memory Management Swapping 1Memory Management Swapping 2
Multi Threading ModelsMultimedia System Compression 1
Multimedia System Compression 2Multimedia System Compression 3
Multimedia System Cpu Disk SchedulingMultimedia System Network Management
Network File System 1Network File System 2
Network Structure TopologyOperating System
Process Control BlockProcess Creation
Process RpcProcess Scheduling Queue
Process StructuresProcess Sync Monitors
Process SynchronizationProcesses
Protection Access MatrixProtection Concepts
Protection Memory ProtectionProtection Revocation Access Rights
RobustnessRtos
Secondary StorageSecurity
Security CryptographySecurity Intrusion Detection
Security Program System ThreatsSecurity System Facility
Security User AuthenticationSemaphores 1
Semaphores 2Swap Space Management
ThreadsThreads Cancellation
Threads Fork ExecThreads Pools
Threads Signal HandlingThreads Ult Klt
Two Port NetworkVirtual Memory
Virtual Memory Demand PagingVirtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1Virtual 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