Memory Management Swapping 1 MCQs

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

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

Attempt Memory Management Swapping 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

Which of the following is true?

A. Overlays are used to increase the size of physical memory
B. Overlays are used to increase the logical address space
C. When overlays are used, the size of a process is not limited to the size of the physical memory
D. Overlays are used whenever the physical address space is smaller than the logical address space

Read more about this MCQ

What is Address Binding?

A. Going to an address in memory
B. Locating an address with the help of another address
C. Binding two addresses together to form a new address in a different memory space
D. A mapping from one address space to another

Read more about this MCQ

Binding of instructions and data to memory addresses can be done at ____________

A. Compile time
B. Load time
C. Execution time
D. All of the mentioned

Read more about this MCQ

If the process can be moved during its execution from one memory segment to another, then binding must be ____________

A. Delayed until run time
B. Preponed to compile time
C. Preponed to load time
D. None of the mentioned

Read more about this MCQ

What is Dynamic loading?

A. Loading multiple routines dynamically
B. Loading a routine only when it is called
C. Loading multiple routines randomly
D. None of the mentioned

Read more about this MCQ

What is the advantage of dynamic loading?

A. A used routine is used multiple times
B. An unused routine is never loaded
C. Cpu utilization increases
D. All of the mentioned

Read more about this MCQ

The idea of overlays is to ____________

A. Data that are needed at any given time
B. Enable a process to be larger than the amount of memory allocated to it
C. Keep in memory only those instructions
D. All of the mentioned

Read more about this MCQ

The ___________ must design and program the overlay structure.

A. Programmer
B. System architect
C. System designer
D. None of the mentioned

Read more about this MCQ

The ___________ swaps processes in and out of the memory.

A. Memory manager
B. Cpu
C. Cpu manager
D. User

Read more about this MCQ

If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?

A. Priority swapping
B. Pull out, push in
C. Roll out, roll in
D. None of the mentioned

Read more about this MCQ

MCQs Menu

Memory Management Swapping 1 MCQs

Operating System Subcategories

MCQs Menu

Past Papers