Font size
WorksheetsOSS (QUIZ 5) - Memory Management
Total questions: 25
Worksheet time: 13mins
What is the fastest type of memory in the memory hierarchy?
RAM
Cache Memory
Hard Drive
Registers
Which memory allocation strategy assigns consecutive memory blocks to a process?
Paging
Segmentation
Contiguous Memory Allocation
Virtual Memory
What problem does fixed partitioning in memory allocation cause?
Internal Fragmentation
External Fragmentation
Thrashing
Page Faults
In paging, what keeps track of pages in physical memory?
Page Table
Segment Table
Cache
Stack
Which of the following best describes virtual memory?
Memory that is located on the CPU
A technique that extends RAM using secondary storage
Memory allocated to the operating system only
Memory that cannot be swapped
Which page replacement algorithm removes the least recently used page?
FIFO
LRU
Optimal Algorithm
Clock Algorithm
Which of the following causes a page fault?
When a process is terminated
When a required page is not found in RAM
When a process uses too much memory
When RAM is full
What is a benefit of segmentation over paging?
Eliminates fragmentation completely
Uses fixed-size blocks for storage
Allows logical division of memory based on segments
Faster access to data
What type of fragmentation does dynamic partitioning suffer from?
Internal Fragmentation
External Fragmentation
Page Faults
Thrashing
Which memory allocation algorithm chooses the smallest block that fits the process?
First Fit
Best Fit
Worst Fit
Next Fit
Paging can cause internal fragmentation.
True
False
Virtual memory is only used when physical memory is full.
True
False
The FIFO page replacement algorithm removes the oldest page from memory.
True
False
The page table is used in segmentation.
True
False
Thrashing occurs when the system spends most of its time swapping pages in and out of memory.
True
False
Registers have a lower access time than cache memory.
True
False
The best fit memory allocation algorithm always leads to the most efficient memory use.
True
False
Non-contiguous memory allocation requires segmentation or paging.
True
False
In demand paging, all pages of a process are loaded into memory at once.
True
False
The optimal page replacement algorithm is practically impossible to implement in real systems.
True
False
The smallest and fastest type of memory located in the CPU.
(Type your answer in ALL SMALL LETTERS)
(a)
A memory management technique that allows processes to execute using more memory than physically available.
(Type your answer in ALL SMALL LETTERS)
(a)
A data structure used in paging to keep track of memory locations.
(Type your answer in ALL SMALL LETTERS)
(a)
The part of memory where frequently accessed data is stored for fast retrieval.
(Type your answer in ALL SMALL LETTERS)
(a)
The algorithm that replaces the page that will not be used for the longest time.
(Type your answer in ALL SMALL LETTERS)
(a)
