MCQs City

Operating System » Virtual Memory Frame Allocation

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

The minimum number of frames to be allocated to a process is decided by the ____________

A. The amount of available physical memory
B. Operating system
C. Instruction set architecture
D. None of the mentioned

Read more about this MCQ

When a page fault occurs before an executing instruction is complete if ____________

A. The instruction must be restarted
B. The instruction must be ignored
C. The instruction must be completed ignoring the page fault
D. None of the mentioned

Read more about this MCQ

Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _____ frame(s).

A. One
B. Two
C. Three
D. None of the mentioned

Read more about this MCQ

The maximum number of frames per process is defined by ____________

A. The amount of available physical memory
B. Operating system
C. Instruction set architecture
D. None of the mentioned

Read more about this MCQ

The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________

A. Proportional allocation algorithm
B. Equal allocation algorithm
C. Split allocation algorithm
D. None of the mentioned

Read more about this MCQ

The algorithm in which we allocate memory to each process according to its size is known as ____________

A. Proportional allocation algorithm
B. Equal allocation algorithm
C. Split allocation algorithm
D. None of the mentioned

Read more about this MCQ

With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.

A. Greater than
B. Same as
C. Lesser than
D. None of the mentioned

Read more about this MCQ

_________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.

A. Local
B. Universal
C. Global
D. Public

Read more about this MCQ

_________ replacement allows each process to only select from its own set of allocated frames.

A. Local
B. Universal
C. Global
D. Public

Read more about this MCQ

One problem with the global replacement algorithm is that ____________

A. It is very expensive
B. Many frames can be allocated to a process
C. Only a few frames can be allocated to a process
D. A process cannot control its own page ? fault rate

Read more about this MCQ

MCQs Menu

Past Papers