1. What is Paging ? Junior A. the actual location in main memory referenced by the memory unit B. a scheme dividing memory into fixed-size frames and processes into equal-size pages C. a per-process structure mapping each virtual page number to its physical frame number D. a trap raised when a process accesses a page that is not currently in physical memory
2. Which term means: "a scheme dividing memory into fixed-size frames and processes into equal-size pages"? Junior A. Page table B. Paging C. Translation Lookaside Buffer D. Memory Management Unit
3. Which statement is correct? Junior A. Paging — loading a page into memory only when it is first referenced rather than all at once B. Paging — a per-process structure mapping each virtual page number to its physical frame number C. Paging — a scheme dividing memory into fixed-size frames and processes into equal-size pages D. Paging — moving an entire process between main memory and a backing store on disk
4. What is Segmentation ? Junior A. free memory split into small non-contiguous holes too scattered to satisfy a request B. wasted space inside an allocated block when the request is smaller than the fixed unit given C. a scheme dividing a process into variable-size logical segments like code, stack and data D. a trap raised when a process accesses a page that is not currently in physical memory
5. Which term means: "a scheme dividing a process into variable-size logical segments like code, stack and data"? Junior A. Segmentation B. Virtual memory C. Internal fragmentation D. External fragmentation
6. Which statement is correct? Junior A. Segmentation — a small fast cache holding recent page-to-frame translations to speed up address lookup B. Segmentation — an abstraction letting a process use an address space larger than the physical RAM available C. Segmentation — the virtual address generated by the CPU that must be mapped to a real location D. Segmentation — a scheme dividing a process into variable-size logical segments like code, stack and data
7. What is Page table ? Junior A. a scheme dividing memory into fixed-size frames and processes into equal-size pages B. the hardware that translates logical addresses into physical addresses at run time C. a per-process structure mapping each virtual page number to its physical frame number D. moving an entire process between main memory and a backing store on disk
8. Which term means: "a per-process structure mapping each virtual page number to its physical frame number"? Junior A. Page table B. Translation Lookaside Buffer C. Paging D. Memory Management Unit
9. Which statement is correct? Junior A. Page table — the virtual address generated by the CPU that must be mapped to a real location B. Page table — a per-process structure mapping each virtual page number to its physical frame number C. Page table — a small fast cache holding recent page-to-frame translations to speed up address lookup D. Page table — wasted space inside an allocated block when the request is smaller than the fixed unit given
10. What is Translation Lookaside Buffer ? Mid A. a small fast cache holding recent page-to-frame translations to speed up address lookup B. a scheme dividing a process into variable-size logical segments like code, stack and data C. a per-process structure mapping each virtual page number to its physical frame number D. the virtual address generated by the CPU that must be mapped to a real location
11. Which term means: "a small fast cache holding recent page-to-frame translations to speed up address lookup"? Mid A. Page table B. Internal fragmentation C. Translation Lookaside Buffer D. Page fault
12. Which statement is correct? Mid A. Translation Lookaside Buffer — wasted space inside an allocated block when the request is smaller than the fixed unit given B. Translation Lookaside Buffer — a small fast cache holding recent page-to-frame translations to speed up address lookup C. Translation Lookaside Buffer — an abstraction letting a process use an address space larger than the physical RAM available D. Translation Lookaside Buffer — the virtual address generated by the CPU that must be mapped to a real location
13. What is Internal fragmentation ? Junior A. free memory split into small non-contiguous holes too scattered to satisfy a request B. wasted space inside an allocated block when the request is smaller than the fixed unit given C. the virtual address generated by the CPU that must be mapped to a real location D. a per-process structure mapping each virtual page number to its physical frame number
14. Which term means: "wasted space inside an allocated block when the request is smaller than the fixed unit given"? Junior A. Internal fragmentation B. Swapping C. Logical address D. External fragmentation
15. Which statement is correct? Junior A. Internal fragmentation — a scheme dividing a process into variable-size logical segments like code, stack and data B. Internal fragmentation — a per-process structure mapping each virtual page number to its physical frame number C. Internal fragmentation — wasted space inside an allocated block when the request is smaller than the fixed unit given D. Internal fragmentation — loading a page into memory only when it is first referenced rather than all at once
16. What is External fragmentation ? Junior A. the hardware that translates logical addresses into physical addresses at run time B. wasted space inside an allocated block when the request is smaller than the fixed unit given C. free memory split into small non-contiguous holes too scattered to satisfy a request D. splitting a large page table into a hierarchy of tables to avoid keeping it all in memory
17. Which term means: "free memory split into small non-contiguous holes too scattered to satisfy a request"? Junior A. External fragmentation B. Internal fragmentation C. Multilevel paging D. Memory Management Unit
18. Which statement is correct? Junior A. External fragmentation — free memory split into small non-contiguous holes too scattered to satisfy a request B. External fragmentation — wasted space inside an allocated block when the request is smaller than the fixed unit given C. External fragmentation — a scheme dividing memory into fixed-size frames and processes into equal-size pages D. External fragmentation — an abstraction letting a process use an address space larger than the physical RAM available
19. What is Virtual memory ? Mid A. the virtual address generated by the CPU that must be mapped to a real location B. splitting a large page table into a hierarchy of tables to avoid keeping it all in memory C. an abstraction letting a process use an address space larger than the physical RAM available D. loading a page into memory only when it is first referenced rather than all at once
20. Which term means: "an abstraction letting a process use an address space larger than the physical RAM available"? Mid A. Virtual memory B. Page table C. Logical address D. Internal fragmentation
21. Which statement is correct? Mid A. Virtual memory — the virtual address generated by the CPU that must be mapped to a real location B. Virtual memory — an abstraction letting a process use an address space larger than the physical RAM available C. Virtual memory — the actual location in main memory referenced by the memory unit D. Virtual memory — a per-process structure mapping each virtual page number to its physical frame number
22. What is Demand paging ? Mid A. the hardware that translates logical addresses into physical addresses at run time B. a per-process structure mapping each virtual page number to its physical frame number C. loading a page into memory only when it is first referenced rather than all at once D. a trap raised when a process accesses a page that is not currently in physical memory
23. Which term means: "loading a page into memory only when it is first referenced rather than all at once"? Mid A. Physical address B. Demand paging C. Logical address D. Translation Lookaside Buffer
24. Which statement is correct? Mid A. Demand paging — loading a page into memory only when it is first referenced rather than all at once B. Demand paging — an abstraction letting a process use an address space larger than the physical RAM available C. Demand paging — a small fast cache holding recent page-to-frame translations to speed up address lookup D. Demand paging — the actual location in main memory referenced by the memory unit
25. What is Page fault ? Mid A. a scheme dividing a process into variable-size logical segments like code, stack and data B. wasted space inside an allocated block when the request is smaller than the fixed unit given C. a scheme dividing memory into fixed-size frames and processes into equal-size pages D. a trap raised when a process accesses a page that is not currently in physical memory
26. Which term means: "a trap raised when a process accesses a page that is not currently in physical memory"? Mid A. Virtual memory B. Page table C. Segmentation D. Page fault
27. Which statement is correct? Mid A. Page fault — an abstraction letting a process use an address space larger than the physical RAM available B. Page fault — a trap raised when a process accesses a page that is not currently in physical memory C. Page fault — the virtual address generated by the CPU that must be mapped to a real location D. Page fault — moving an entire process between main memory and a backing store on disk
28. What is Swapping ? Mid A. moving an entire process between main memory and a backing store on disk B. a trap raised when a process accesses a page that is not currently in physical memory C. free memory split into small non-contiguous holes too scattered to satisfy a request D. an abstraction letting a process use an address space larger than the physical RAM available
29. Which term means: "moving an entire process between main memory and a backing store on disk"? Mid A. Memory Management Unit B. Translation Lookaside Buffer C. Swapping D. Page fault
30. Which statement is correct? Mid A. Swapping — free memory split into small non-contiguous holes too scattered to satisfy a request B. Swapping — a scheme dividing memory into fixed-size frames and processes into equal-size pages C. Swapping — a scheme dividing a process into variable-size logical segments like code, stack and data D. Swapping — moving an entire process between main memory and a backing store on disk Showing 30 of 42 OS · Memory Management questions — the full set, with answers, explanations and an AI tutor on every question, is inside.