Virtual Memory Page Replacement Algorithms 1 MCQs

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

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

Attempt Virtual Memory Page Replacement Algorithms 1 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

A FIFO replacement algorithm associates with each page the _______

A. Time it was brought into memory
B. Size of the page in memory
C. Page after and before it
D. All of the mentioned

Read more about this MCQ

Which of the following page replacement algorithms suffers from Belady’s Anomaly?

A. Optimal replacement
B. Lru
C. Fifo
D. Both optimal replacement and fifo

Read more about this MCQ

A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is?

A. 8
B. 10
C. 9
D. 7

Read more about this MCQ

A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers ____________

A. Decreases
B. Increases
C. Remains the same
D. None of the mentioned

Read more about this MCQ

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________

A. Lru
B. Lfu
C. Fifo
D. None of the mentioned

Read more about this MCQ

A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements. P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE?

A. Both p and q are true, and q is the reason for p
B. Both p and q are true, but q is not the reason for p
C. P is false but q is true
D. Both p and q are false

Read more about this MCQ

Users _______ that their processes are running on a paged system.

A. Are aware
B. Are unaware
C. May unaware
D. None of the mentioned

Read more about this MCQ

If no frames are free, _____ page transfer(s) is/are required.

A. One
B. Two
C. Three
D. Four

Read more about this MCQ

When a page is selected for replacement, and its modify bit is set ____________

A. The page is clean
B. The page has been modified since it was read in from the disk
C. The page is dirty
D. The page has been modified since it was read in from the disk & page is dirty

Read more about this MCQ

The aim of creating page replacement algorithms is to ____________

A. Replace pages faster
B. Increase the page fault rate
C. Decrease the page fault rate
D. To allocate multiple pages to processes

Read more about this MCQ

MCQs Menu

Virtual Memory Page Replacement Algorithms 1 MCQs

Operating System Subcategories

MCQs Menu

Past Papers