Multiple Choice
In Additional-Reference-Bits algorithm,
A) the least-recently used page is identified very efficiently on a page fault.
B) a group of pages that have not been used recently are efficiently identified.
C) a page that has been referenced most recently is identified.
D) None of the above.
Correct Answer:
Verified
Correct Answer:
Verified
Q44: Explain the distinction between global allocation versus
Q45: Prepaging an executable program is much easier
Q46: Some operating systems keep a pool of
Q47: Lock bit is NOT used for which
Q48: Given the reference string of page accesses:
Q49: Explain how copy-on-write operates.
Q50: A drawback of equal or proportional allocation
Q51: How are lock bits useful in I/O
Q52: Which of the following is true about
Q53: Explain how working set model works.