Multiple Choice
The Second-Chance algorithm
A) is same as FIFO algorithm if all pages in memory have been referenced at least once since the last page fault.
B) is same as FIFO algorithm if none of the pages in memory have been referenced since the last page fault.
C) is same as LRU algorithm if all pages in memory have been referenced at least once since the last page fault.
D) is same as LRU algorithm if none of the pages in memory have been referenced since the last page fault.
Correct Answer:

Verified
Correct Answer:
Verified
Q16: Which of the following does not increase
Q17: A page fault must be preceded by
Q18: Discuss two strategies for increasing TLB reach.
Q19: Which of the following is FALSE about
Q20: In Linux, a slab may only be
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.
Q25: Counting based page replacement algorithms are not
Q26: The instruction that causes a page fault