Counting based page replacement algorithms are not commonly used, because
A) they only approximate LRU.
B) they are expensive to implement, even though they incur the least number of page faults.
C) they do not approximate OPT replacement very well and their implementation is expensive.
D) they do not approximate OPT replacement very well, even though they are easy to implement.
Correct Answer:
Verified
Q5: The dirty (modify) bit identifies
A) a page
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
Q11: Optimal page replacement _.
A) is the page-replacement
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
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