What is the main purpose of paging in memory management?

To divide the memory into fixed-size blocks

To divide the memory into variable-sized sections

To divide the memory into fixed-size blocks

To eliminate external fragmentation

The table that maps logical page numbers to physical frame numbers is called:

Translation Lookaside Buffer (TLB)

A page fault occurs when:

A page is not found in main memory

The CPU cache fails to retrieve data

Which type of fragmentation is resolved using paging?

Both internal and external fragmentation

Fragmentation cannot be resolved by paging

The Translation Lookaside Buffer (TLB) is used to:

Cache recently used page table entries

The base and limit registers are used in segmentation to:

Specify the segment size and starting address

Map virtual memory to physical memory

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

A major advantage of virtual memory is:

Increased effective memory size

What does a "dirty bit" indicate in a page table entry?

Whether a page has been modified since loading into memory

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

Memory Management MCQ Quiz: Paging, Segmentation and Virtual Memory

Questions: 30

Questions

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

Ready to put your knowledge to the test? Take this exam and evaluate your understanding of the subject.

Memory Management MCQ Quiz: Paging, Segmentation and Virtual Memory

1. What is the main purpose of paging in memory management?

2. The table that maps logical page numbers to physical frame numbers is called:

3. A page fault occurs when:

4. Which type of fragmentation is resolved using paging?

5. The Translation Lookaside Buffer (TLB) is used to:

6. The base and limit registers are used in segmentation to:

7. Virtual memory allows:

8. Which replacement algorithm is considered optimal for page replacement?

9. A major advantage of virtual memory is:

10. What does a "dirty bit" indicate in a page table entry?

11. Page size in a paging system is determined by:

12. Which memory management technique is used to reduce page faults?

13. Internal fragmentation in paging occurs because:

14. What happens when a process tries to access a memory location outside its segment bounds?

15. The purpose of demand paging is to:

16. Which replacement algorithm may suffer from the "Belady's anomaly"?

17. The concept of a "working set" in memory management refers to:

18. Thrashing occurs when:

19. Which hardware component is necessary for implementing paging?

20. What is the role of a page fault handler?

21. What is the effect of increasing page size in a paging system?

22. Segmentation is particularly useful for:

23. Which of the following is a valid segment identifier in a segmentation system?

24. Paging and segmentation can be combined to:

25. The primary function of the memory management unit (MMU) is to:

26. The Clock algorithm for page replacement improves upon:

27. Which field in a page table entry indicates whether a page is currently in main memory?

28. Virtual memory size depends on:

29. Which technique reduces the number of levels in a multi-level page table?

30. The main drawback of segmentation compared to paging is:

Explore

IT Fundamentals

Professional Development

Psychology Insights