Memory Allocation 2 MCQs

10 MCQs — Operating System MCQs

Practice Memory Allocation 2 MCQs with correct answers and explanations. These questions are from the Operating System MCQs section.

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

In internal fragmentation, memory is internal to a partition and ____________

A. Is being used
B. Is not being used
C. Is always used
D. None of the mentioned

Read more about this MCQ

A solution to the problem of external fragmentation is ____________

A. Compaction
B. Larger memory space
C. Smaller memory space
D. None of the mentioned

Read more about this MCQ

Another solution to the problem of external fragmentation problem is to ____________

A. Permit the logical address space of a process to be noncontiguous
B. Permit smaller processes to be allocated memory at last
C. Permit larger processes to be allocated memory at last
D. All of the mentioned

Read more about this MCQ

If relocation is static and is done at assembly or load time, compaction _________

A. Cannot be done
B. Must be done
C. Must not be done
D. Can be done

Read more about this MCQ

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is ____________

A. The cost incurred
B. The memory used
C. The cpu used
D. All of the mentioned

Read more about this MCQ

__________ is generally faster than _________ and _________

A. First fit, best fit, worst fit
B. Best fit, first fit, worst fit
C. Worst fit, best fit, first fit
D. None of the mentioned

Read more about this MCQ

External fragmentation exists when?

A. Enough total memory exists to satisfy a request but it is not contiguous
B. The total memory is insufficient to satisfy a request
C. A request cannot be satisfied even when the total memory is free
D. None of the mentioned

Read more about this MCQ

External fragmentation will not occur when?

A. First fit is used
B. Best fit is used
C. Worst fit is used
D. No matter which algorithm is used, it will always occur

Read more about this MCQ

Sometimes the overhead of keeping track of a hole might be ____________

A. Larger than the memory
B. Larger than the hole itself
C. Very small
D. All of the mentioned

Read more about this MCQ

When the memory allocated to a process is slightly larger than the process, then ____________

A. Internal fragmentation occurs
B. External fragmentation occurs
C. Both internal and external fragmentation occurs
D. Neither internal nor external fragmentation occurs

Read more about this MCQ

MCQs Menu

Past Papers