1. What is a virtual-memory miss called?
(A) Hit miss
(B) Page hit
(C) Page miss
(D) Page fault
2. When a process is copied into the main memory from the secondary memory, what is this operation called?
(A) Swapping
(B) Paging
(C) Segmentation
(D) Demand paging
3. What is the term for a process that spends more time paging than executing?
(A) It spends more time paging than executing
(B) It spends less time paging than executing
(C) Page fault occurs
(D) Swapping cannot take place
4. Where does swap space exist?
(A) CPU
(B) Primary memory
(C) Secondary memory
(D) None of the mentioned
5. What occurs when a program tries to access a page that is mapped in address space but not loaded in physical memory?
(A) Page fault occurs
(B) Fatal error occurs
(C) Segmentation fault occurs
(D) No error occurs
6. Effective access time is directly proportional to:
(A) Memory access time
(B) Page-fault rate
(C) Hit ratio
(D) None of the mentioned
7. In the FIFO page replacement algorithm, when a page must be replaced, which page is chosen?
(A) Oldest page is chosen
(B) Newest page is chosen
(C) Median page is chosen
(D) None of the mentioned
8. Which algorithm chooses the page that has not been used for the longest period of time when a page needs to be replaced?
(A) Additional reference bit algorithm
(B) Least recently used algorithm
(C) Counting based page replacement algorithm
(D) First in first out algorithm
9. The pager concerns with the:
(A) Entire thread
(B) First page of a process
(C) Individual page of a process
(D) Entire process
10. The working set model for page replacement is based on the assumption of:
(A) Globalization
(B) Random access
(C) Modularity
(D) Locality
11. What is the term for the separation of user logical memory and physical memory?
(A) Memory sharing
(B) Virtual memory
(C) Memory management
(D) Memory control
12. Is logical address space larger than physical address space?
(A) True
(B) False
Answer: (A) True
13. Virtual memory can be implemented via:
(A) Simple division
(B) Logical paging
(C) Demand paging
(D) Complex division
14. What does COW stand for in memory management?
(A) Convert overwrite
(B) Copy overwrite
(C) Cut overwrite
(D) Copy on write
15. What does LRU stand for in page replacement algorithms?
(A) Less Recently used
(B) Least Recurrently used
(C) Least Randomly used
(D) Least Recently used
16. Which allocation uses a proportional allocation scheme using priorities rather than size?
(A) Simple allocation
(B) File allocation
(C) Priority allocation
(D) Preference allocation
17. Which replacement strategy selects a replacement frame from the set of all frames?
(A) Global replacement
(B) Local replacement
(C) Module replacement
(D) Block replacement
18. When any program, no matter how small, occupies an entire partition, this is known as:
(A) Fragmentation
(B) External fragmentation
(C) Internal fragmentation
(D) Prior fragmentation
19. Which term describes a process that is busy swapping pages in and out?
(A) Division
(B) External fragmentation
(C) Thrashing
(D) Compaction
20. Select the most appropriate term for one or more physically contiguous pages.
(A) Allocator
(B) Object
(C) Slab
(D) Cache
21. Which technique is implemented by magnetic disks for secondary memory?
(A) Main memory
(B) Cache
(C) Buffer
(D) Virtual memory
22. Because of virtual memory, memory can be shared among:
(A) Threads
(B) Processes
(C) Instructions
(D) None of the mentioned
