edited by
145 views
3 votes
3 votes

For the following reference-modify ordered pair, match the following columns-
$$\begin{array}{|ll|ll|}
\hline\text{I.} & \text{(Reference bit = 0, Modify bit = 0)} & \quad \text{P.} & \text{Must write out before replacement}
\\\hline \text{II.} & \text{(Reference bit = 0, Modify bit = 1)} & \quad \text{Q.} & \text{Probably will be used again soon and need to} \\& & & \text{write out before replacement}
\\\hline \text{III.} & \text{(Reference bit = 1, Modify bit = 0)} & \quad \text{R.} & \text{Best page to replace}
\\\hline \text{IV.} & \text{(Reference bit = 1, Modify bit = 1)} & \quad \text{S.} & \text{Probably will be used again soon}
\\\hline \end{array}$$

  1. $\text{I - R, II - P, III - S, IV - Q}$
  2. $\text{I - R, II - P, III - Q, IV - S}$
  3. $\text{I - Q, II - P, III - S, IV - R}$
  4. $\text{I - Q, II - P, III - R, IV - S}$
edited by

1 Answer

2 votes
2 votes
When a page is referenced, due to spatial locality it is expected to be used sooner (just expectation; not a guarantee).

When modify bit is set, it means the page is modified and so must be saved to secondary storage before being replaced.

So, correct option is A.
Answer:

Related questions

2 votes
2 votes
2 answers
1
gatecse asked Dec 7, 2020
307 views
In a stack page replacement algorithm, the set of pages in a $k$-frame memory is always a subset of pages in a _________ frame memory (Mark all the appropriate choices)$k...
2 votes
2 votes
1 answer
4
gatecse asked Dec 7, 2020
206 views
Which of the following page replacement algorithms exhibit Belady's anomaly? (Mark all the appropriate choices)Optimal page replacementFirst in First out (FIFO)Least rece...