Hashed Page Tables is nonmally used for less than 32 bin address True False Due

Question

Hashed Page Tables is nonmally used for less than 32 bin address True False Due to equal size of the pages and frames, swapping becomes very easy True O False Lazy swapper Allway swaps a page into memory unless page will be needed True False Mutual exclusion: Hold and wait Circular wailt all above This algorithm is based on the argument that the page with the smallest count was probably just brought in and has yet to be used. O LFU FIFO The runtime mapping from virtual to physical address is done by Memory allocation pation memory management unit (MMU Memory addressing table page map table If hit ratio is 0.9 and TLB lookup time is 0.2 microseconds, then EAT is in microseconds. Dining Philosophers Problem is a Ciassical Problems of Synchronization True False

Explanation / Answer

1) False, Its common in address space > 32 bits
2) True,Due to equal size of the pages and frames, swapping becomes very easy.
3) False, A lazy swapper never swaps a page into memory unless that page is needed
4)All the above
5) MFU, smallest count was probably just brought in and has yet to be used
6) MMU
7) Memory Access time is not given : I am not sure of it , Still -> 0.9 * 0.2 = 0.018
8) TRue, Its a classical problem of Synchronization


Thanks, PLEASE UPVOTE if helpful

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

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