OS · Page Replacement interview questions

1. A.an algorithm that evicts the page that has not been used for the longest time
2. B.the set of pages a process has actively referenced within a recent time window
3. C.a second-chance approximation of LRU that arranges pages in a circular list with reference bits
4. D.choosing which resident page to evict when a new page must be loaded into a full memory

Answer + AI explanation with a free account

1. A.Belady's anomaly
2. B.Page replacement
3. C.Reference bit
4. D.Optimal page replacement

Answer + AI explanation with a free account

1. A.Page replacement — an algorithm that evicts the page with the smallest count of past references
2. B.Page replacement — an algorithm that evicts the page that has not been used for the longest time
3. C.Page replacement — choosing which resident page to evict when a new page must be loaded into a full memory
4. D.Page replacement — an access in which the requested page is already present in physical memory

Answer + AI explanation with a free account

1. A.an algorithm that evicts the page that has been in memory the longest
2. B.an algorithm that evicts the page with the smallest count of past references
3. C.the set of pages a process has actively referenced within a recent time window
4. D.choosing which resident page to evict when a new page must be loaded into a full memory

Answer + AI explanation with a free account

1. A.FIFO page replacement
2. B.Clock algorithm
3. C.Belady's anomaly
4. D.Working set

Answer + AI explanation with a free account

1. A.FIFO page replacement — an algorithm that evicts the page with the smallest count of past references
2. B.FIFO page replacement — an algorithm that evicts the page that has been in memory the longest
3. C.FIFO page replacement — a theoretical algorithm that evicts the page not needed for the longest time in the future
4. D.FIFO page replacement — an algorithm that evicts the page that has not been used for the longest time

Answer + AI explanation with a free account

1. A.the set of pages a process has actively referenced within a recent time window
2. B.an access in which the requested page is already present in physical memory
3. C.an algorithm that evicts the page that has not been used for the longest time
4. D.an algorithm that evicts the page with the smallest count of past references

Answer + AI explanation with a free account

1. A.Belady's anomaly
2. B.Reference bit
3. C.LRU page replacement
4. D.Page miss

Answer + AI explanation with a free account

1. A.LRU page replacement — a per-page hardware flag set on access and used by approximation algorithms to estimate recent use
2. B.LRU page replacement — an algorithm that evicts the page that has not been used for the longest time
3. C.LRU page replacement — the surprising case where adding more frames increases the page-fault count under FIFO
4. D.LRU page replacement — an algorithm that evicts the page with the smallest count of past references

Answer + AI explanation with a free account

1. A.choosing which resident page to evict when a new page must be loaded into a full memory
2. B.a per-page hardware flag set on access and used by approximation algorithms to estimate recent use
3. C.a theoretical algorithm that evicts the page not needed for the longest time in the future
4. D.the surprising case where adding more frames increases the page-fault count under FIFO

Answer + AI explanation with a free account

1. A.LRU page replacement
2. B.Page miss
3. C.Optimal page replacement
4. D.Page replacement

Answer + AI explanation with a free account

1. A.Optimal page replacement — an algorithm that evicts the page that has been in memory the longest
2. B.Optimal page replacement — a theoretical algorithm that evicts the page not needed for the longest time in the future
3. C.Optimal page replacement — an access in which the requested page is already present in physical memory
4. D.Optimal page replacement — choosing which resident page to evict when a new page must be loaded into a full memory

Answer + AI explanation with a free account

1. A.an algorithm that evicts the page that has been in memory the longest
2. B.an algorithm that evicts the page with the smallest count of past references
3. C.an access in which the requested page is already present in physical memory
4. D.an algorithm that evicts the page that has not been used for the longest time

Answer + AI explanation with a free account

1. A.LRU page replacement
2. B.Page hit
3. C.LFU page replacement
4. D.Clock algorithm

Answer + AI explanation with a free account

1. A.LFU page replacement — choosing which resident page to evict when a new page must be loaded into a full memory
2. B.LFU page replacement — a theoretical algorithm that evicts the page not needed for the longest time in the future
3. C.LFU page replacement — an algorithm that evicts the page with the smallest count of past references
4. D.LFU page replacement — an algorithm that evicts the page that has been in memory the longest

Answer + AI explanation with a free account

1. A.an access in which the requested page is already present in physical memory
2. B.a state of excessive paging where the system spends more time swapping pages than executing
3. C.a second-chance approximation of LRU that arranges pages in a circular list with reference bits
4. D.an access in which the requested page is absent, triggering a page fault

Answer + AI explanation with a free account

1. A.Reference bit
2. B.FIFO page replacement
3. C.LRU page replacement
4. D.Clock algorithm

Answer + AI explanation with a free account

1. A.Clock algorithm — an algorithm that evicts the page with the smallest count of past references
2. B.Clock algorithm — a state of excessive paging where the system spends more time swapping pages than executing
3. C.Clock algorithm — a second-chance approximation of LRU that arranges pages in a circular list with reference bits
4. D.Clock algorithm — an access in which the requested page is absent, triggering a page fault

Answer + AI explanation with a free account

1. A.a state of excessive paging where the system spends more time swapping pages than executing
2. B.the surprising case where adding more frames increases the page-fault count under FIFO
3. C.an algorithm that evicts the page that has not been used for the longest time
4. D.a theoretical algorithm that evicts the page not needed for the longest time in the future

Answer + AI explanation with a free account

1. A.Belady's anomaly
2. B.Optimal page replacement
3. C.Page replacement
4. D.Thrashing

Answer + AI explanation with a free account

1. A.Belady's anomaly — a state of excessive paging where the system spends more time swapping pages than executing
2. B.Belady's anomaly — the surprising case where adding more frames increases the page-fault count under FIFO
3. C.Belady's anomaly — a second-chance approximation of LRU that arranges pages in a circular list with reference bits
4. D.Belady's anomaly — an algorithm that evicts the page that has not been used for the longest time

Answer + AI explanation with a free account

1. A.the surprising case where adding more frames increases the page-fault count under FIFO
2. B.a per-page hardware flag set on access and used by approximation algorithms to estimate recent use
3. C.an algorithm that evicts the page that has been in memory the longest
4. D.a state of excessive paging where the system spends more time swapping pages than executing

Answer + AI explanation with a free account

1. A.Optimal page replacement
2. B.LFU page replacement
3. C.Thrashing
4. D.Page hit

Answer + AI explanation with a free account

1. A.Thrashing — a state of excessive paging where the system spends more time swapping pages than executing
2. B.Thrashing — the set of pages a process has actively referenced within a recent time window
3. C.Thrashing — an access in which the requested page is absent, triggering a page fault
4. D.Thrashing — a theoretical algorithm that evicts the page not needed for the longest time in the future

Answer + AI explanation with a free account

1. A.an access in which the requested page is absent, triggering a page fault
2. B.a theoretical algorithm that evicts the page not needed for the longest time in the future
3. C.an access in which the requested page is already present in physical memory
4. D.the set of pages a process has actively referenced within a recent time window

Answer + AI explanation with a free account

1. A.Thrashing
2. B.Belady's anomaly
3. C.Page miss
4. D.Working set

Answer + AI explanation with a free account

1. A.Working set — the set of pages a process has actively referenced within a recent time window
2. B.Working set — an algorithm that evicts the page that has been in memory the longest
3. C.Working set — an access in which the requested page is already present in physical memory
4. D.Working set — a per-page hardware flag set on access and used by approximation algorithms to estimate recent use

Answer + AI explanation with a free account

1. A.an access in which the requested page is already present in physical memory
2. B.an access in which the requested page is absent, triggering a page fault
3. C.choosing which resident page to evict when a new page must be loaded into a full memory
4. D.a second-chance approximation of LRU that arranges pages in a circular list with reference bits

Answer + AI explanation with a free account

1. A.Page miss
2. B.Clock algorithm
3. C.Page hit
4. D.FIFO page replacement

Answer + AI explanation with a free account

1. A.Page hit — a second-chance approximation of LRU that arranges pages in a circular list with reference bits
2. B.Page hit — an access in which the requested page is already present in physical memory
3. C.Page hit — an algorithm that evicts the page that has been in memory the longest
4. D.Page hit — the surprising case where adding more frames increases the page-fault count under FIFO

Answer + AI explanation with a free account