Virtual Memory Page Replacement Algorithms 1 — Test 1
Page 1 of 2
Question 1
A FIFO replacement algorithm associates with each page the _______
System Administrator 2026
Question 2
Which of the following page replacement algorithms suffers from Belady’s Anomaly?
0
System Administrator 2026
Question 3
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?
0
System Administrator 2026
Question 4
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 ____________
0
System Administrator 2026
Question 5
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 ____________
0
System Administrator 2026
Question 6
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements. P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE?
0
System Administrator 2026
Question 7
Users _______ that their processes are running on a paged system.
0
System Administrator 2026
Question 8
If no frames are free, _____ page transfer(s) is/are required.
0
System Administrator 2026
Question 9
When a page is selected for replacement, and its modify bit is set ____________
0
System Administrator 2026
Question 10
The aim of creating page replacement algorithms is to ____________
0
System Administrator 2026