The sequence of steps for a page-replacement algorithm will be:
A. Find a frame that is not currently being used
B. Change the page table
C. Use the freed frame
D. No frame is free
E. Free a frame
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. D, A, E, B, C
Explanation
When no frame is free, the OS chooses a victim frame not currently in use, frees it (writing it out if needed), updates the page tables, and uses the freed frame for the new page.More System Software and Operating System questions
- Which of the following control problems does NOT exist when processes are unaware of each other during interaction?
- Match List I with List IIList I List II A. Batch Multiprogramming I. Allows more efficient use of main memory B. Time sharing II. User no l…
- Match List I with List IIList I List II A. RAID level-2 I. Block-interleaved B. RAID level-3 II. Error-correcting-code C. RAID level-4 III.…
- Match List I with List II (thread operations)List I List II A. Thread spawn I. To convert a blocking system call into a non-blocking call B…
- Which of the following is NOT correct about virtual-memory segmentation?
- Which of the following is NOT a characteristic of a specialised embedded OS?