1.
When using counters to implement LRU, we replace the page with the :
Answer: Option 'A'
smallest time value
2.
In the stack implementation of the LRU algorithm, a stack can be maintained in a manner :
Answer: Option 'B'
the bottom of the stack is the LRU page
3.
There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called :
Answer: Option 'B'
stack algorithms
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 ?
Answer: Option 'C'
4
5.
Increasing the RAM of a computer typically improves performance because:
Answer: Option 'C'
Fewer page faults occur
6.
The essential content(s) in each entry of a page table is / are :
Answer: Option 'B'
Page frame number
7.
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by :
Answer: Option 'A'
the instruction set architecture
8.
The implementation of the LFU and the MFU algorithm is very uncommon because :
Answer: Option 'C'
they are expensive
9.
The reason for using the LFU page replacement algorithm is :
Answer: Option 'A'
an actively used page should have a large reference count
10.
The reason for using the MFU page replacement algorithm is :
Answer: Option 'B'
a less used page has more chances to be used again