Explore topic-wise MCQs in Operating System.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.

1.

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» B. size of the page in memory
Discussion
2.

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» C. it is too complex
Discussion
3.

Optimal page – replacement algorithm is :$#

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» D. None of the mentioned
Discussion
4.

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» C. page after and before it
Discussion
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» D. to allocate multiple pages to processes
Discussion
6.

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» D. Both optimal replacement and FIFO
Discussion