Font size
WorksheetsSummative Quiz: Memory Management
Total questions: 40
Worksheet time: 35mins
Memory management is a central component of any operating system because:
It controls the monitor display
It manages efficient allocation of memory to processes
It handles only I/O devices
It prevents the CPU from overheating
Which of the following is NOT a basic requirement of memory management?
Relocation
Protection
Fragmentation
Sharing
In hierarchical memory, which level is the fastest but smallest in size?
Registers
Cache
Primary memory
Secondary memory
When a program may be placed at different locations during execution, the requirement is called:
Sharing
Relocation
Fragmentation
Protection
The method that protects one process from interfering with another’s memory space is:
Swapping
Protection
Partitioning
Overlay
Which memory management requirement allows multiple processes to access the same portion of memory?
Sharing
Relocation
Logical organization
Partitioning
In logical organization, modules can have different degrees of protection such as:
Boot-only
Delete-only
Read-only or Execute-only
Write-only
Which memory is non-volatile, cheaper, and larger in capacity?
Main memory
Cache
Secondary memory
Registers
Fixed partitioning results in:
Internal fragmentation
No wasted space
Infinite partitions
Dynamic resizing
When processes are allocated exactly as much memory as required, this is called:
Fixed partitioning
Dynamic partitioning
Segmentation
Overlaying
The algorithm that selects the smallest free block to fit a process in dynamic partitioning is:
First-fit
Worst-fit
Best-fit
Next-fit
Paging divides memory into fixed-size blocks called:
Segments
Frames
Pages
Blocks
In paging, the chunks of a process are called:
Pages
Frames
Segments
Buffers
The table that maps each page of a process to a frame in physical memory is called:
Process Control Block
Frame Directory
Page Table
Memory Map
Segmentation differs from paging in that segments are:
Fixed-length
Variable-length
Always equal to frames
Stored only in cache
Internal fragmentation occurs in:
Fixed partitioning
Paging
Segmentation
Dynamic partitioning
The process of moving a process between main memory and secondary storage is called:
Mapping
Swapping
Fragmentation
Linking
Virtual memory allows:
Execution of processes larger than main memory
Elimination of secondary storage
Faster cache access
Permanent storage of processes
Static linking means:
All library routines are linked at load time
Libraries are linked at compile time
Linking happens only when program runs
Linking changes during execution
Dynamic loading means:
The entire program is loaded at once
Routines are loaded only when called
Programs cannot be swapped
Processes are fixed in memory
Memory must be allocated efficiently to maintain a reasonable supply of (a) processes.
(a) is the requirement that ensures a program can run regardless of its physical location.
The OS must check memory permissions at (a) time to guarantee protection.
Programs are organized into modules such as stack, text, and (a) data.
Allowing processes to use the same copy of a program instead of separate copies is called (a) .
__________ memory is volatile and relatively expensive.
(a) memory is slower, cheaper, and non-volatile.
In fixed partitioning, unused parts of memory partitions result in (a) fragmentation.
(a) partitioning allows partitions to vary in size and number.
A (a) algorithm assigns a process to the smallest block in dynamic partitioning.
In paging, process chunks are called __________, while memory chunks are called __________.
Pages
Frames
A (a) contains the mapping between pages and frames.
Segmentation uses (a) -length blocks instead of fixed-length blocks.
(a) memory enables execution of processes larger than the available main memory.
Moving processes between main memory and secondary storage is called (a) .
Explain why memory management is considered a central component of the operating system.
Compare fixed partitioning and dynamic partitioning in terms of advantages and problems.
Differentiate between paging and segmentation, with examples.
Why are relocation and protection requirements interrelated in memory management?
Explain how virtual memory solves the problem of limited physical memory.
