PROBLEM 2 reference string 2 3 2 1 5 2 4 5 3 2 5 2 FIFO Given the reference stri

Question

PROBLEM 2 reference string 2 3 2 1 5 2 4 5 3 2 5 2 FIFO Given the reference string above as shown for process number p2: 1. Fill in above charts based on indicated algorithm, and enter number of page faults where shown 2. How many frames were allocated to process P2: 3. What is the final size of the resident set of pages for process P2: 4. The numbers in the reference string refer to: pages 5. The maximum number of page faults that P2 can have is: 12 6 The minimum number of page faults that P2 can have is: 7. The number of frames needed to guarantee a minimum number of page faults is page faults. 25

Explanation / Answer

2. The number of frames allocated to process p2 is 3 , so we have just 3 frames with us. If the page in the reference string is not available in these 3 frames,we have to replace a page with the page replacement algorithms leading to page faults.

3. Final Size of number of pages is also 3(for pages 3,5,2)

4. pages .here they are 1,2,3,4 and 5.

5. maximum page faults happen when there is no page in the frames available or matches the reference string for 12 pages. So maximum page faults =12.

6. Minimum number of page faults is the number of pages ie 5. So we assume that once these pages are loaded they are always available. Only first time loading leads to page fault.

7. Number of frames needed to guarantee a minimum number of page fault is 5.

5 frames

1 2 3 4 5

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.