Virtual Memory Page Replacement Algorithms 2 — Test 1
Page 1 of 1
Question 1
When using counters to implement LRU, we replace the page with the ____________
0
System Administrator 2026
Question 2
In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________
0
System Administrator 2026
Question 3
There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________
0
System Administrator 2026
Question 4
Applying the LRU page replacement to the following reference string. 1 2 4 5 2 1 2 4 The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2. How many page faults will occur?
0
System Administrator 2026
Question 5
Increasing the RAM of a computer typically improves performance because ____________
0
System Administrator 2026
Question 6
The essential content(s) in each entry of a page table is/are ____________
0
System Administrator 2026
Question 7
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by ____________
0
System Administrator 2026
Question 8
What is the reason for using the LFU page replacement algorithm?
0
System Administrator 2026
Question 9
What is the reason for using the MFU page replacement algorithm?
0
System Administrator 2026
Question 10
The implementation of the LFU and the MFU algorithm is very uncommon because ____________
0
System Administrator 2026