MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System Questions & Answers Virtual Memory Page Replacement Algorithms 1 knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 |
| A. | nHow many page faults does the LRU page replacement algorithm produce? |
| B. | 10 |
| C. | 15 |
| D. | 11 |
| E. | 12 |
| Answer» E. 12 | |
| 2. |
LRU page replacement algorithm associates with each page the ______ |
| A. | time it was brought into memory |
| B. | the time of that page s last use |
| C. | page after and before it |
| D. | all of the mentioned |
| Answer» C. page after and before it | |
| 3. |
Optimal page replacement algorithm is difficult to implement, because ____________ |
| A. | it requires a lot of information |
| B. | it requires future knowledge of the reference string |
| C. | it is too complex |
| D. | it is extremely expensive |
| Answer» C. it is too complex | |
| 4. |
What is the Optimal page replacement algorithm? |
| A. | Replace the page that has not been used for a long time |
| B. | Replace the page that has been used for a long time |
| C. | Replace the page that will not be used for a long time |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
The aim of creating page replacement algorithms is to ____________ |
| A. | replace pages faster |
| B. | increase the page fault rate |
| C. | decrease the page fault rate |
| D. | to allocate multiple pages to processes |
| Answer» D. to allocate multiple pages to processes | |
| 6. |
When a page is selected for replacement, and its modify bit is set ____________ |
| A. | the page is clean |
| B. | the page has been modified since it was read in from the disk |
| C. | the page is dirty |
| D. | the page has been modified since it was read in from the disk & page is dirty |
| Answer» E. | |
| 7. |
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________ |
| A. | LRU |
| B. | LFU |
| C. | FIFO |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page frames is increased to 4, then the number of page transfers ____________ |
| A. | decreases |
| B. | increases |
| C. | remains the same |
| D. | none of the mentioned |
| Answer» C. remains the same | |
| 9. |
A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is? |
| A. | 8 |
| B. | 10 |
| C. | 9 |
| D. | 7 |
| Answer» D. 7 | |
| 10. |
Which of the following page replacement algorithms suffers from Belady s Anomaly? |
| A. | Optimal replacement |
| B. | LRU |
| C. | FIFO |
| D. | Both optimal replacement and FIFO |
| Answer» D. Both optimal replacement and FIFO | |