Operating System MCQ and Answers – Page Replacement Algorithms

These Operating System MCQ and Answers – Page Replacement Algorithms are asked in various examinations including BCA, MCA, GATE, and other tests. The questions based on the below Operating System MCQ and Answers – Page Replacement Algorithms test your basic knowledge of MCQs on the topic of Operating Systems and the level of comprehension and grasp that you hold.

Operating System MCQ and Answers – Page Replacement Algorithms

1. 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: c

2. Users _______ that their processes are running on a paged system.

a) are aware

b) are unaware

c) may unaware

d) none of the mentioned

Answer: b

3. If no frames are free, _____ page transfer(s) is/are required.

a) one

b) two

c) three

d) four

Answer: b

4. 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: d

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: c

6. A FIFO replacement algorithm associates with each page the _______

a) time it was brought into memory

b) size of the page in memory

c) page after and before it

d) all of the mentioned

Answer: a

7. 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: c

8. 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: b

9. 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: b

10. What are the two methods of the LRU page replacement policy that can be implemented in hardware?

a) Counters

b) RAM & Registers

c) Stack & Counters

d) Registers

Answer: c

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

a) smallest time value

b) largest time value

c) greatest size

d) none of the mentioned

Answer: a

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

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

b) the bottom of the stack is the LRU page

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

d) none of the mentioned

Answer: b

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

a) queue algorithms

b) stack algorithms

c) string algorithms

d) none of the mentioned

Answer: b

14. Increasing the RAM of a computer typically improves performance because ____________

a) Virtual memory increases

b) Larger RAMs are faster

c) Fewer page faults occur

d) None of the mentioned

Answer: c

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

a) Virtual page number

b) Page frame number

c) Both virtual page number and page frame number

d) Access right information

Answer: b

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

a) the instruction set architecture

b) page size

c) physical memory size

d) number of processes in memory

Answer: a

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

a) an actively used page should have a large reference count

b) a less used page has more chances to be used again

c) it is extremely efficient and optimal

d) all of the mentioned

Answer: a

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

a) an actively used page should have a large reference count

b) a less used page has more chances to be used again

c) it is extremely efficient and optimal

d) all of the mentioned

Answer: b

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

a) they are too complicated

b) they are optimal

c) they are expensive

d) all of the mentioned

Answer: c

20. 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: c

Comments