Virtual Memory Page Replacement Algorithms 2 MCQs

10 MCQs — Operating System MCQs

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

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

When using counters to implement LRU, we replace the page with the ____________

A. Smallest time value
B. Largest time value
C. Greatest size
D. None of the mentioned

Read more about this MCQ

In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________

A. Whenever a page is used, it is removed from the stack and put on bottom
B. The bottom of the stack is the lru page
C. The top of the stack contains the lru page and all new pages are added to the top
D. None of the mentioned

Read more about this MCQ

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________

A. Queue algorithms
B. Stack algorithms
C. String algorithms
D. None of the mentioned

Read more about this MCQ

Applying the LRU page replacement to the following reference string. 1 2 4 5 2 1 2 4 The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2. How many page faults will occur?

A. 2
B. 3
C. 4
D. 5

Read more about this MCQ

Increasing the RAM of a computer typically improves performance because ____________

A. Virtual memory increases
B. Larger rams are faster
C. Fewer page faults occur
D. None of the mentioned

Read more about this MCQ

The essential content(s) in each entry of a page table is/are ____________

A. Virtual page number
B. Page frame number
C. Both virtual page number and page frame number
D. Access right information

Read more about this MCQ

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by ____________

A. The instruction set architecture
B. Page size
C. Physical memory size
D. Number of processes in memory

Read more about this MCQ

What is the reason for using the LFU page replacement algorithm?

A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. All of the mentioned

Read more about this MCQ

What is the reason for using the MFU page replacement algorithm?

A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. All of the mentioned

Read more about this MCQ

The implementation of the LFU and the MFU algorithm is very uncommon because ____________

A. They are too complicated
B. They are optimal
C. They are expensive
D. All of the mentioned

Read more about this MCQ

MCQs Menu

Virtual Memory Page Replacement Algorithms 2 MCQs

Operating System Subcategories

MCQs Menu

Past Papers