Consider a demand paging system with three frames, and the following page reference string: \[ 1\ 2\ 3\ 4\ 5\ 4\ 1\ 6\ 4\ 5\ 1\ 3\ 2. \] The contents of the frames are as follows initially and after each reference (from left to right):
The *-marked references cause page replacements. Which one or more of the following could be the page replacement policy/policies in use?
Thus, the correct answer is (D) Optimal Page Replacement Policy, as it most accurately reflects the page replacement strategy demonstrated in the sequence.
Three villages P, Q, and R are located in such a way that the distance PQ = 13 km, QR = 14 km, and RP = 15 km, as shown in the figure. A straight road joins Q and R. It is proposed to connect P to this road QR by constructing another road. What is the minimum possible length (in km) of this connecting road?
Note: The figure shown is representative.
For the clock shown in the figure, if
O = O Q S Z P R T, and
X = X Z P W Y O Q,
then which one among the given options is most appropriate for P?