Memory Management Practice Questions
Questions:
1. Which type of memory is volatile and loses its contents when power is off?
A. ROM
B. RAM
C. EEPROM
D. PROM
2. What does MMU stand for in memory management?
A. Memory Management Unit
B. Main Memory Unit
C. Modular Memory Utility
D. Memory Mapping Unit
3. What is the purpose of the BIOS stored in ROM?
A. Temporarily store user data
B. Access computer hardware and load the OS
C. Erase memory content
D. Execute the CPU's instructions
4. What type of memory is erased by exposing it to ultraviolet light?
A. PROM
B. EPROM
C. EEPROM
D. RAM
5. Which is NOT a job of the memory manager?
A. Keep track of memory in use
B. Allocate memory to processes
C. Create new programs
D. Manage swapping
6. What term refers to processes waiting to be brought into memory for execution?
A. Ready Queue
B. Input Queue
C. Memory Queue
D. Execution Queue
7. Which hardware device maps virtual to physical addresses?
A. ALU
B. MMU
C. DMA
D. CPU
8. What is the primary advantage of paging in memory management?
A. Eliminates internal fragmentation
B. Reduces external fragmentation
C. Speeds up disk access
D. Requires no page table
9. What mechanism is used to reduce external fragmentation?
A. Compaction
B. Swapping
C. Paging
D. Segmentation
10. What is the term for memory addresses generated by the CPU?
A. Physical Address
B. Logical Address
C. Base Address
D. Offset Address
11. In the MMU scheme, what is added to the usergenerated address?
A. Base register value
B. Offset value
C. Cache data
D. Logical page number
12. Which memory allocation strategy searches for the smallest free block?
A. Firstfit
B. Bestfit
C. Worstfit
D. Quickfit
13. What is the primary disadvantage of the MFT (Multiprogramming with Fixed Tasks) approach?
A. Internal fragmentation
B. External fragmentation
C. Lack of dynamic partitioning
D. High overhead
14. In which stage is relocatable code generated?
A. Compile time
B. Load time
C. Execution time
D. Linking time
15. What is external fragmentation?
A. Unused memory within allocated regions
B. Noncontiguous free memory blocks
C. Overlapping memory partitions
D. Free memory exceeding process size
16. What is a key difference between static and dynamic linking?
A. Static linking avoids runtime dependencies.
B. Dynamic linking compiles all modules together.
C. Static linking uses shared objects.
D. Dynamic linking creates larger executables.
17. What happens during swapping in memory management?
A. Processes are prioritized for execution.
B. Memory is compacted to reduce fragmentation.
C. A process is moved between main memory and secondary storage.
D. Page tables are updated.
18. Which hardware device enables direct memory access?
A. MMU
B. DMA
C. Cache controller
D. ALU
19. What is the primary disadvantage of paging?
A. Internal fragmentation
B. External fragmentation
C. Complex memory allocation
D. Lack of dynamic loading
20. In segmentation, what does each segment represent?
A. A fixedsize block of memory
B. A variablelength module of related functions
C. A single instruction
D. A page of virtual memory
21. Which type of memory allocation is used to prevent internal fragmentation?
A. Contiguous allocation
B. Noncontiguous allocation
C. Paging
D. Static allocation
22. What term describes the state where total unused memory cannot be allocated due to
noncontiguity?
A. Internal fragmentation
B. External fragmentation
C. Memory compaction
D. Memory thrashing
23. What is the function of the limit register in memory allocation?
A. Protect processes from each other
B. Track free memory regions
C. Define the maximum logical address
D. Map logical to physical addresses
24. What is the role of the relocation register?
A. Calculate the base address for physical memory
B. Swap processes in and out of memory
C. Store the page table entries
D. Manage cache memory
25. What is a key characteristic of dynamic loading?
A. Entire program loaded at once
B. Modules loaded as needed
C. Static partitioning
D. Requires memory compaction
26. What type of fragmentation occurs when memory blocks are too small to satisfy a request?
A. Internal fragmentation
B. External fragmentation
C. Paging fragmentation
D. Segment fragmentation
27. Which memory management technique divides processes into fixedsize blocks?
A. Segmentation
B. Paging
C. Contiguous allocation
D. Swapping
28. What is the purpose of a page table in paging?
A. Map logical addresses to physical addresses
B. Track free memory blocks
C. Manage cache memory
D. Monitor CPU usage
29. In paging, what is the combination of page number and offset called?
A. Logical address
B. Physical address
C. Virtual address
D. Frame address
30. What mechanism is used to improve access time for page tables?
A. Cache memory
B. Translation Lookaside Buffer (TLB)
C. Segmentation
D. Direct Memory Access (DMA)
31. Which type of memory allocation allows processes to grow dynamically?
A. Contiguous allocation
B. Noncontiguous allocation
C. Fixed partitioning
D. Static allocation
32. What happens during a page fault?
A. A process is terminated
B. The required page is brought into memory
C. Memory is compacted
D. The page table is updated
33. Which type of segmentation uses variablelength segments?
A. Paging
B. Dynamic segmentation
C. Contiguous segmentation
D. Fixed segmentation
34. What is the main purpose of the base register in memory allocation?
A. Define the starting address of a process
B. Track free memory regions
C. Manage cache memory
D. Store logical addresses
35. What is a disadvantage of using a single input queue in MFT?
A. Wasted memory space
B. Increased complexity
C. Reduced process prioritization
D. Higher internal fragmentation
36. In a hierarchical paging system, what does the firstlevel page table contain?
A. Logical addresses
B. Physical addresses
C. Pointers to secondlevel page tables
D. Frame numbers
37. What is the purpose of a hashed page table?
A. Reduce memory access time
B. Handle large address spaces
C. Eliminate page faults
D. Optimize memory compaction
38. Which term refers to moving a process from secondary storage to main memory?
A. Swapping
B. Compaction
C. Paging
D. Segmentation
39. What type of memory allocation does segmentation use?
A. Fixedsize blocks
B. Variablelength blocks
C. Contiguous blocks
D. Noncontiguous blocks
40. What is a disadvantage of using dynamic linking?
A. Larger executable size
B. Runtime dependency on libraries
C. Increased memory usage
D. Limited modularity
41. Which type of memory management involves dividing memory into fixedsize frames?
A. Segmentation
B. Paging
C. Contiguous allocation
D. Noncontiguous allocation
42. What is the main disadvantage of using large page sizes in paging?
A. Increased page table size
B. Higher internal fragmentation
C. More page faults
D. Slower access time
43. In which type of fragmentation does memory remain unused within an allocated block?
A. Internal fragmentation
B. External fragmentation
C. Paging fragmentation
D. Segment fragmentation
44. What is the primary benefit of using segmentation over paging?
A. Reduced page faults
B. Variablelength blocks
C. Fixed partitioning
D. Faster memory access
45. What is the role of the TLB in memory management?
A. Store frequently accessed page table entries
B. Manage cache memory
C. Allocate memory to processes
D. Reduce internal fragmentation
46. Which memory management technique is used for virtual memory?
A. Paging
B. Segmentation
C. Contiguous allocation
D. Fixed partitioning
47. What is the purpose of the validinvalid bit in a page table?
A. Indicate if a page is in memory
B. Track free memory blocks
C. Identify the process owning a page
D. Define the page offset
48. What does the term "compaction" refer to in memory management?
A. Combining free memory blocks into one
B. Reducing page table size
C. Eliminating page faults
D. Swapping processes
49. Which type of allocation is most prone to external fragmentation?
A. Contiguous allocation
B. Paging
C. Segmentation
D. Noncontiguous allocation
50. What happens when a process references a page that is not in memory?
A. A page fault occurs
B. The process is terminated
C. Memory is compacted
D. The page table is cleared
Answers:
1. B
2. A
3. B
4. B
5. C
6. B
7. B
8. B
9. A
10. B
11. A
12. B
13. A
14. B
15. B
16. A
17. C
18. B
19. A
20. B
21. C
22. B
23. C
24. A
25. B
26. A
27. B
28. A
29. A
30. B
31. B
32. B
33. B
34. A
35. A
36. C
37. B
38. A
39. B
40. B
41. B
42. B
43. A
44. B
45. A
46. A
47. A
48. A
49. A
50. A
