Multiple Choice
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
Correct Answer:
Verified
Q20: In Linux, a slab may only be
Q21: The Second-Chance algorithm<br>A) is same as FIFO
Q22: How does the second-chance algorithm for page
Q23: Solaris uses both a local and global
Q24: Explain the usefulness of a modify bit.
Q26: The instruction that causes a page fault
Q27: Windows uses both a local and global
Q28: What is the benefit of using sparse
Q29: In demand paging,<br>A) a page loaded in
Q30: Which of the following is true about