Task 5

When using counters to implement LRU, we replace the page with the ____________

• smallest time value

• largest time value

• greatest size

• none of the mentioned

In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________

• whenever a page is used, it is removed from the stack and put on bottom

• the bottom of the stack is the LRU page

• the top of the stack contains the LRU page and all new pages are added to the top

• none of the mentioned

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________

• queue algorithms

• stack algorithms

• string algorithms

• none of the mentioned

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?

• 2

• 3

• 4

• 5

Increasing the RAM of a computer typically improves performance because ____________

• Virtual memory increases

• Larger RAMs are faster

• Fewer page faults occur

• None of the mentioned

The essential content(s) in each entry of a page table is/are ____________

• Virtual page number

• Page frame number

• Both virtual page number and page frame number

• Access right information

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by ____________

• the instruction set architecture

• page size

• physical memory size

• number of processes in memory

What is the reason for using the LFU page replacement algorithm?

• an actively used page should have a large reference count

• a less used page has more chances to be used again

• it is extremely efficient and optimal

• all of the mentioned

What is the reason for using the MFU page replacement algorithm?

• an actively used page should have a large reference count

• a less used page has more chances to be used again

• it is extremely efficient and optimal

• all of the mentioned

The implementation of the LFU and the MFU algorithm is very uncommon because ____________

• they are too complicated

• they are optimal

• they are expensive

• all of the mentioned