Hi, help please. Question 12 7.14 pts The page replacement algorithm that looks

Question

Hi, help please.

Question 12 7.14 pts The page replacement algorithm that looks into the future is: LFU Optimal MFU LRU FIFO Question 13 7.14 pts The virtual memory space of a computer is 232 bytes and the physical memory has 231 bytes. The virtual memory is implemented with paging and the page size if 4096 bytes. What are the page number and page offset for the virtual address OxFEEDBEEF ? (0x is commonly used as a prefix for numbers expressed in hexadecimal or base 16) O 0xFEED, OxBEE O OxFEEDBE, OxEEF O OxFEEDB, OxEEF O can't say without the content of the page table

Explanation / Answer

Question 12 . (b) Optimal Page replacement Algo

In this Optimal Page replacement , pages are replaced which are not used for the longest duration of time in the future.

Eg: page reference string 3 0 4 2 3 1 5 7 0 0 3 2 and 4 page slots.

Initially all slots are empty, so when 3 0 4 2 are allocated to the empty slots
3 is already there so
when 1 came it will take the place of 4 because it is not used for the longest duration of time in the future.

Please ask different question separtely as per chegg guideline.

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

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