Memory Management MCQ Quiz: Paging, Segmentation and Virtual Memory

Test your knowledge of memory management with 30 MCQs on Paging, Segmentation and Virtual Memory. Prepare for exams with detailed concepts and practical scenarios.

📌 Important Instructions

  • ✅ This is a free test. Beware of scammers who ask for money to attend this test.
  • 📋 Total Number of Questions: 30
  • ⏳ Time Allotted: 30 Minutes
  • 📝 Marking Scheme: Each question carries 1 mark. There is no negative marking.
  • ⚠️ Do not refresh or close the page during the test, as it may result in loss of progress.
  • 🔍 Read each question carefully before selecting your answer.
  • 🎯 All the best! Give your best effort and ace the test! 🚀
Time Left: 00:00
1. What is the main purpose of paging in memory management?
  • To divide the memory into variable-sized sections
  • To divide the memory into fixed-size blocks
  • To eliminate external fragmentation
  • To optimize cache utilization
2. The table that maps logical page numbers to physical frame numbers is called:
  • Segment table
  • Page table
  • Translation Lookaside Buffer (TLB)
  • Memory allocation table
3. A page fault occurs when:
  • A page is not found in main memory
  • A page table becomes full
  • Memory access is denied
  • The CPU cache fails to retrieve data
4. Which type of fragmentation is resolved using paging?
  • External fragmentation
  • Internal fragmentation
  • Both internal and external fragmentation
  • Fragmentation cannot be resolved by paging
5. The Translation Lookaside Buffer (TLB) is used to:
  • Store all pages of a process
  • Cache recently used page table entries
  • Reduce internal fragmentation
  • Allocate memory dynamically
6. The base and limit registers are used in segmentation to:
  • Determine the frame size
  • Specify the segment size and starting address
  • Optimize page table lookups
  • Map virtual memory to physical memory
7. Virtual memory allows:
  • Programs to run without being completely loaded into physical memory
  • The elimination of both internal and external fragmentation
  • Physical memory to be expanded dynamically
  • CPU registers to directly store large data
8. Which replacement algorithm is considered optimal for page replacement?
  • Least Recently Used (LRU)
  • First In First Out (FIFO)
  • Optimal Page Replacement
  • Clock Algorithm
9. A major advantage of virtual memory is:
  • Faster CPU access times
  • Reduced disk usage
  • Increased effective memory size
  • Improved cache hit rate
10. What does a "dirty bit" indicate in a page table entry?
  • Whether a page is currently in use
  • Whether a page has been modified since loading into memory
  • Whether a page is stored on disk
  • Whether a page is shared among processes
11. Page size in a paging system is determined by:
  • The size of the program
  • Hardware and operating system configuration
  • The size of the TLB
  • The number of page faults
12. Which memory management technique is used to reduce page faults?
  • Increasing the TLB size
  • Effective page replacement algorithms
  • Reducing the size of physical memory
  • Random memory allocation
13. Internal fragmentation in paging occurs because:
  • Pages are not fully utilized
  • Memory allocation is non-contiguous
  • Segments are larger than needed
  • TLB miss rate is high
14. What happens when a process tries to access a memory location outside its segment bounds?
  • A page fault occurs
  • A segmentation fault occurs
  • The memory is reallocated dynamically
  • The process continues execution without interruption
15. The purpose of demand paging is to:
  • Load only required pages into memory when needed
  • Preload all pages before program execution
  • Eliminate the use of virtual memory
  • Prevent page faults during execution
16. Which replacement algorithm may suffer from the "Belady's anomaly"?
  • Least Recently Used (LRU)
  • Optimal Page Replacement
  • First In First Out (FIFO)
  • Clock Algorithm
17. The concept of a "working set" in memory management refers to:
  • The most recently accessed pages of a process
  • The set of pages that a process needs during a specific time interval
  • Pages currently residing in secondary storage
  • Pages allocated to the operating system kernel
18. Thrashing occurs when:
  • The CPU is underutilized
  • Processes are frequently moved between memory and disk due to high page faults
  • The TLB fails to cache page table entries
  • The system runs out of memory completely
19. Which hardware component is necessary for implementing paging?
  • Segment table
  • Page table
  • CPU registers
  • Memory cache
20. What is the role of a page fault handler?
  • To clear unused memory
  • To bring the required page into memory from disk
  • To allocate more memory to the process
  • To optimize TLB performance
21. What is the effect of increasing page size in a paging system?
  • Decreased internal fragmentation
  • Increased page faults
  • Increased TLB hits
  • Increased internal fragmentation
22. Segmentation is particularly useful for:
  • Programs with variable-sized memory requirements
  • Reducing internal fragmentation
  • Increasing disk I/O speed
  • Replacing page tables
23. Which of the following is a valid segment identifier in a segmentation system?
  • Page number
  • Frame number
  • Segment number
  • Memory offset
24. Paging and segmentation can be combined to:
  • Reduce memory access time
  • Eliminate the need for a page table
  • Provide flexibility in memory allocation
  • Avoid virtual memory altogether
25. The primary function of the memory management unit (MMU) is to:
  • Allocate memory to processes
  • Map virtual addresses to physical addresses
  • Optimize CPU usage
  • Manage secondary storage
26. The Clock algorithm for page replacement improves upon:
  • FIFO by adding a use bit to pages
  • LRU by increasing page reference tracking
  • Optimal Page Replacement by preloading pages
  • Demand Paging by prioritizing page faults
27. Which field in a page table entry indicates whether a page is currently in main memory?
  • Dirty bit
  • Valid/Invalid bit
  • Access bit
  • Reference count
28. Virtual memory size depends on:
  • Physical memory size only
  • Address space of the CPU
  • Page size and frame size
  • Cache memory capacity
29. Which technique reduces the number of levels in a multi-level page table?
  • Hashing
  • Demand paging
  • TLB caching
  • Segmentation
30. The main drawback of segmentation compared to paging is:
  • Increased internal fragmentation
  • Increased external fragmentation
  • Complex page table management
  • Reduced virtual memory size

Explore

IT Fundamentals

Professional Development

Psychology Insights