q33

Page replacement algorithms. A reference string is shown for a process given three frames with no page pre-fetching. The content of the three frames is shown after every access. Page fault (F) is indicated under the frames if the reference caused a page fault, and hence a page replacement. In looking at the reference string and the frames as they change, conjecture and name the page replacement algorithm used. 2 3 3 2 1 5 5 2 2 4 5 3 2 5 2 2 2 3 2 3 2 3 1 5 5 3 2 1 1 F F 5 5 2 2 4 F 3 2 4 F 3 2 4 3 5 4 F 3 5 2 F Page replacement algorithms. For the same reference string shown in the previous question (Question 33), and for the same number of frames (3), run the Second Chance Algorithm, showing the content of the frames as well as their R bits at each reference. Indicate at each reference if a page fault happened by indicating Y/N PF. Hint: linearizing the presentation of your answer will be easier in Canvas. So just follow this format of a "vertical" answer: 2 F1: x, R: 0 or 1 F2: x, R: 0 or 1 F3: x, R: 0 or 1 PF: No Or Yes 3 F1: x, R: 0 or 1 F2: x, R: 0 or 1 F3: x, R: 0 or 1 PF: No or Yes