Optimal page replacement ____.
A) is the page-replacement algorithm most often implemented
B) is used mostly for comparison with other page-replacement schemes
C) can suffer from Belady's anomaly
D) requires that the system keep track of previously used pages
Correct Answer:
Verified
Q6: Given the reference string of page accesses:
Q7: In demand paging,
A) a page loaded in
Q8: If an instruction modifies several different locations,
Q9: A drawback of equal or proportional allocation
Q10: Counting based page replacement algorithms are not
Q12: Suppose we have the following page accesses:
Q13: In Additional-Reference-Bits algorithm,
A) the least-recently used page
Q14: If an architecture has a move instruction
Q15: Stack algorithms are a class of page
Q16: Suppose we have the following page accesses:
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