Question: When a page is not present in the memory ,MMU raises an interrupt called a __________
Answer:
while performing address translation for a logical address pair (pi,bi) , the MMU check the valid bit of the page table entry of pi .if the bit indicates the pi is not present in memory, the MMU raises an interrupt called a missing page interrupt or a page fault.
MCQ: When a page is not present in the memory ,MMU raises an interrupt called a __________
Explanation:
while performing address translation for a logical address pair (pi,bi) , the MMU check the valid bit of the page table entry of pi .if the bit indicates the pi is not present in memory, the MMU raises an interrupt called a missing page interrupt or a page fault.
Discuss a Question
Related Questions
- 1. Which of the following operations are performed by the Virtual memory manager when page fault occurs?
- 2. The virtual memory manager uses a page replacement algorithm to select one of the pages currently in memory for replacement, accesses the page table entry of the selected page to mark it as “not present” in memory and initiates a ________operation for it if the modified bit of its page table entry indicates that it is dirty page.
- 3. The virtual memory manager initiates a _____ operation to load the required page into the page frame that was occupied by the selected page and it updates the page table entry of the page to record frame number of the page frame, marks the page as “present” and makes provision to resume operation of the process.
- 4. Page-in and page-out operations are required to implement demand paging constitutes _______
- 5. Which of the following stands true for Effective memory access time for a process in demand paging?
- 6. Which of the following stands true for Effective memory access time for a process in demand paging?Where <strong><em>pr<sub>1</sub></em></strong><sub> </sub>= probability that a page exists in memory, <strong><em>t<sub>mem</sub></em></strong> = memory access time , <strong><em>t<sub>pfh</sub></em></strong> = time overhead of page fault handling
- 7. Which of the following stands true for Effective memory access time for a process in demand paging? Where <strong><em>pr<sub>1</sub></em></strong><sub> </sub>= probability that a page exists in memory, <strong><em>t<sub>mem</sub></em></strong> = memory access time , <strong><em>t<sub>pfh</sub></em></strong> = time overhead of page fault handling
- 8. Page replacement becomes necessary when <ol> <li>Page faults occur and there are no free page frames in the memory.</li> <li>Page faults occur and there are free page frames in the memory.</li> <li>Page faults would arise if the replaced page is referenced again.</li> <li>It is important to replace a page that is not likely to be referenced again in the immediate future.</li> </ol>
- 9. Which of the following statements stands true for locality of reference in page replacement and handling page faults?
- 10. The computer exploits the law of locality to ensure__________
You may be interested in:
OS Memory Management MCQsRecently Added Articles
How Can AI Simplify the Academic Life of Students?
Last updated on: April 16, 2025Posted by: ExamRadar
Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Last updated on: March 10, 2025Posted by: ExamRadar
Top AI Tools for Instantly Detecting Plagiarized Writing
Last updated on: December 5, 2024Posted by: ExamRadar
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Last updated on: November 22, 2024Posted by: ExamRadar
Image to Text Conversion Made Easy: Online Tool Insights
Last updated on: April 12, 2024Posted by: ExamRadar
