Match List I (reference bit, modify bit) with List II (enhanced second-chance algorithm)
| List I | List II |
|---|---|
| A. (reference = 0, modify = 0) | I. Must write out before replacement. |
| B. (reference = 0, modify = 1) | II. Probably will be used again soon and needs to be written out. |
| C. (reference = 1, modify = 0) | III. Best page to replace. |
| D. (reference = 1, modify = 1) | IV. Probably will be used again soon. |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. A-III, B-I, C-IV, D-II
Explanation
(0,0): neither recently used nor modified, the best page to replace (III). (0,1): must be written out before replacement (I). (1,0): probably used again soon (IV). (1,1): probably used again soon and needs writing out (II).More System Software and Operating System questions
- A disk has 300 cylinders (0 to 299). The read-write head is at cylinder 101, moving towards the higher end. Calculate the total head moveme…
- Statement I: The main objective of using virtual memory is to increase the effective capacity of the memory system. Statement II: The size…
- In the Linux operating system, when ________ is invoked, it is passed a set of flags that determine how much sharing is to take place betwe…
- The main function of the microkernel is to provide a communication facility between the ________ program and the various ________ that are…
- Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorith…
- For the following set of processes scheduled using the FCFS policy, determine the average waiting time. The processes arrived in the order…