LRU replaces the page that has spent the ________.
A) longest time in memory
B) longest time in memory without being referenced
C) shortest time in memory
D) shortest time in memory without being referenced
Correct Answer:
Verified
Q11: Under a random page replacement strategy, _.
A)
Q12: A FIFO page-replacement strategy can be implemented
Q13: Why is a FIFO page-replacement strategy impractical
Q14: According to the FIFO Anomaly (also called
Q15: The least-recently-used (LRU) page-replacement strategy _.
A) can
Q17: The least-frequently-used (LFU) page-replacement strategy can be
Q18: Under a not-used-recently (NUR) page-replacement strategy, the
Q19: NUR is based on the idea that
Q20: The second-chance page-replacement strategy _.
A) moves pages
Q21: The far page-replacement strategy utilizes an _
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents