1. What is Page replacement ? Junior A. an algorithm that evicts the page that has not been used for the longest time B. the set of pages a process has actively referenced within a recent time window C. a second-chance approximation of LRU that arranges pages in a circular list with reference bits D. choosing which resident page to evict when a new page must be loaded into a full memory
2. Which term means: "choosing which resident page to evict when a new page must be loaded into a full memory"? Junior A. Belady's anomaly B. Page replacement C. Reference bit D. Optimal page replacement
3. Which statement is correct? Junior A. Page replacement — an algorithm that evicts the page with the smallest count of past references B. Page replacement — an algorithm that evicts the page that has not been used for the longest time C. Page replacement — choosing which resident page to evict when a new page must be loaded into a full memory D. Page replacement — an access in which the requested page is already present in physical memory
4. What is FIFO page replacement ? Junior A. an algorithm that evicts the page that has been in memory the longest B. an algorithm that evicts the page with the smallest count of past references C. the set of pages a process has actively referenced within a recent time window D. choosing which resident page to evict when a new page must be loaded into a full memory
5. Which term means: "an algorithm that evicts the page that has been in memory the longest"? Junior A. FIFO page replacement B. Clock algorithm C. Belady's anomaly D. Working set
6. Which statement is correct? Junior A. FIFO page replacement — an algorithm that evicts the page with the smallest count of past references B. FIFO page replacement — an algorithm that evicts the page that has been in memory the longest C. FIFO page replacement — a theoretical algorithm that evicts the page not needed for the longest time in the future D. FIFO page replacement — an algorithm that evicts the page that has not been used for the longest time
7. What is LRU page replacement ? Mid A. the set of pages a process has actively referenced within a recent time window B. an access in which the requested page is already present in physical memory C. an algorithm that evicts the page that has not been used for the longest time D. an algorithm that evicts the page with the smallest count of past references
8. Which term means: "an algorithm that evicts the page that has not been used for the longest time"? Mid A. Belady's anomaly B. Reference bit C. LRU page replacement D. Page miss
9. Which statement is correct? Mid A. LRU page replacement — a per-page hardware flag set on access and used by approximation algorithms to estimate recent use B. LRU page replacement — an algorithm that evicts the page that has not been used for the longest time C. LRU page replacement — the surprising case where adding more frames increases the page-fault count under FIFO D. LRU page replacement — an algorithm that evicts the page with the smallest count of past references
10. What is Optimal page replacement ? Senior A. choosing which resident page to evict when a new page must be loaded into a full memory B. a per-page hardware flag set on access and used by approximation algorithms to estimate recent use C. a theoretical algorithm that evicts the page not needed for the longest time in the future D. the surprising case where adding more frames increases the page-fault count under FIFO
11. Which term means: "a theoretical algorithm that evicts the page not needed for the longest time in the future"? Senior A. LRU page replacement B. Page miss C. Optimal page replacement D. Page replacement
12. Which statement is correct? Senior A. Optimal page replacement — an algorithm that evicts the page that has been in memory the longest B. Optimal page replacement — a theoretical algorithm that evicts the page not needed for the longest time in the future C. Optimal page replacement — an access in which the requested page is already present in physical memory D. Optimal page replacement — choosing which resident page to evict when a new page must be loaded into a full memory
13. What is LFU page replacement ? Mid A. an algorithm that evicts the page that has been in memory the longest B. an algorithm that evicts the page with the smallest count of past references C. an access in which the requested page is already present in physical memory D. an algorithm that evicts the page that has not been used for the longest time
14. Which term means: "an algorithm that evicts the page with the smallest count of past references"? Mid A. LRU page replacement B. Page hit C. LFU page replacement D. Clock algorithm
15. Which statement is correct? Mid A. LFU page replacement — choosing which resident page to evict when a new page must be loaded into a full memory B. LFU page replacement — a theoretical algorithm that evicts the page not needed for the longest time in the future C. LFU page replacement — an algorithm that evicts the page with the smallest count of past references D. LFU page replacement — an algorithm that evicts the page that has been in memory the longest
16. What is Clock algorithm ? Mid A. an access in which the requested page is already present in physical memory B. a state of excessive paging where the system spends more time swapping pages than executing C. a second-chance approximation of LRU that arranges pages in a circular list with reference bits D. an access in which the requested page is absent, triggering a page fault
17. Which term means: "a second-chance approximation of LRU that arranges pages in a circular list with reference bits"? Mid A. Reference bit B. FIFO page replacement C. LRU page replacement D. Clock algorithm
18. Which statement is correct? Mid A. Clock algorithm — an algorithm that evicts the page with the smallest count of past references B. Clock algorithm — a state of excessive paging where the system spends more time swapping pages than executing C. Clock algorithm — a second-chance approximation of LRU that arranges pages in a circular list with reference bits D. Clock algorithm — an access in which the requested page is absent, triggering a page fault
19. What is Belady's anomaly ? Senior A. a state of excessive paging where the system spends more time swapping pages than executing B. the surprising case where adding more frames increases the page-fault count under FIFO C. an algorithm that evicts the page that has not been used for the longest time D. a theoretical algorithm that evicts the page not needed for the longest time in the future
20. Which term means: "the surprising case where adding more frames increases the page-fault count under FIFO"? Senior A. Belady's anomaly B. Optimal page replacement C. Page replacement D. Thrashing
21. Which statement is correct? Senior A. Belady's anomaly — a state of excessive paging where the system spends more time swapping pages than executing B. Belady's anomaly — the surprising case where adding more frames increases the page-fault count under FIFO C. Belady's anomaly — a second-chance approximation of LRU that arranges pages in a circular list with reference bits D. Belady's anomaly — an algorithm that evicts the page that has not been used for the longest time
22. What is Thrashing ? Mid A. the surprising case where adding more frames increases the page-fault count under FIFO B. a per-page hardware flag set on access and used by approximation algorithms to estimate recent use C. an algorithm that evicts the page that has been in memory the longest D. a state of excessive paging where the system spends more time swapping pages than executing
23. Which term means: "a state of excessive paging where the system spends more time swapping pages than executing"? Mid A. Optimal page replacement B. LFU page replacement C. Thrashing D. Page hit
24. Which statement is correct? Mid A. Thrashing — a state of excessive paging where the system spends more time swapping pages than executing B. Thrashing — the set of pages a process has actively referenced within a recent time window C. Thrashing — an access in which the requested page is absent, triggering a page fault D. Thrashing — a theoretical algorithm that evicts the page not needed for the longest time in the future
25. What is Working set ? Senior A. an access in which the requested page is absent, triggering a page fault B. a theoretical algorithm that evicts the page not needed for the longest time in the future C. an access in which the requested page is already present in physical memory D. the set of pages a process has actively referenced within a recent time window
26. Which term means: "the set of pages a process has actively referenced within a recent time window"? Senior A. Thrashing B. Belady's anomaly C. Page miss D. Working set
27. Which statement is correct? Senior A. Working set — the set of pages a process has actively referenced within a recent time window B. Working set — an algorithm that evicts the page that has been in memory the longest C. Working set — an access in which the requested page is already present in physical memory D. Working set — a per-page hardware flag set on access and used by approximation algorithms to estimate recent use
28. What is Page hit ? Junior A. an access in which the requested page is already present in physical memory B. an access in which the requested page is absent, triggering a page fault C. choosing which resident page to evict when a new page must be loaded into a full memory D. a second-chance approximation of LRU that arranges pages in a circular list with reference bits
29. Which term means: "an access in which the requested page is already present in physical memory"? Junior A. Page miss B. Clock algorithm C. Page hit D. FIFO page replacement
30. Which statement is correct? Junior A. Page hit — a second-chance approximation of LRU that arranges pages in a circular list with reference bits B. Page hit — an access in which the requested page is already present in physical memory C. Page hit — an algorithm that evicts the page that has been in memory the longest D. Page hit — the surprising case where adding more frames increases the page-fault count under FIFO Showing 30 of 36 OS · Page Replacement questions — the full set, with answers, explanations and an AI tutor on every question, is inside.