adplus-dvertising

Welcome to the Page Replacement Algorithms MCQs Page

Dive deep into the fascinating world of Page Replacement Algorithms with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Page Replacement Algorithms, a crucial aspect of Operating System. In this section, you will encounter a diverse range of MCQs that cover various aspects of Page Replacement Algorithms, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Operating System.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Page Replacement Algorithms. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Operating System.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Page Replacement Algorithms. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Page Replacement Algorithms MCQs | Page 2 of 4

Explore more Topics under Operating System

Q11.
When size of the memory is increased the page replacement policy that sometimes leads to more page faults is called _________ .

a.

FIFO

b.

Optimal

c.

LRU

d.

None of the above

Discuss
Answer: (a).FIFO
Q12.
The average time of service a page fault is 10ms and the time taken to access the memory is 1µs. A 99.99% hit ratio results in average memory their access time is __________.

a.

1.9999µs

b.

1.9999ms

c.

1ms

d.

9.99µs

Discuss
Answer: (a).1.9999µs
Q13.
A system that uses FIFO page replacement policy has 4 page frames with no pages loaded initially. 100 distinct pages are accessed by the system in some order and then the same 100 pages are accessed in the reverse order. How many page faults will occur?

a.

193

b.

194

c.

195

d.

196

Discuss
Answer: (d).196
Q14.
Match the following lists:

a. Gang scheduling ------------------------------- i. Guaranteed scheduling
b. Rate monotonic scheduling ------------------ ii. Real-time scheduling
c. Fair share scheduling ------------------------- iii. Thread scheduling

a.

a – i, b – iii, c - ii

b.

a – iii, b – ii, c - i

c.

a – i, b – ii, c - iii

d.

a – ii, b – iii, c - i

Discuss
Answer: (b).a – iii, b – ii, c - i
Q15.
Which page is selected by the Optimal Page Replacement Algorithm?

a.

The page that has been used for maximum.

b.

The page that has been used minimum.

c.

The page that has not been used for the longest time in the past.

d.

The page that will not be used for the longest time in the future.

Discuss
Answer: (d).The page that will not be used for the longest time in the future.
Q16.
Which of the following statements is true for the dirty page in a page table?

a.

Helps to maintain LRU information

b.

Allows only read on a page

c.

Helps to avoid unnecessary writes on paging device

d.

None of the above

Discuss
Answer: (c).Helps to avoid unnecessary writes on paging device
Q17.
We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
How many page faults will occur for the above reference string with the Least Recently Used(LRU) Page Replacement Policy in comparison to an Optimal Page Replacement policy?

a.

3

b.

2

c.

1

d.

0

Discuss
Answer: (b).2
Q18.
We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
If Optimal Page Replacement policy is used, _______ page faults will occur for the above reference string.

a.

7

b.

8

c.

9

d.

6

Discuss
Answer: (a).7
Q19.
What is page cannibalizing?

a.

Page swapping or Page replacements

b.

Adding timestamps to the page

c.

Avoiding page replacements

d.

All the above

Discuss
Answer: (a).Page swapping or Page replacements
Q20.
‘LRU’ page replacement policy is

a.

Last Replaced Unit.

b.

Last Restored Unit.

c.

Least Recently Used.

d.

Least Required Unit.

Discuss
Answer: (c).Least Recently Used.
Page 2 of 4

Suggested Topics

Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Software Engineering

Learn about the systematic approach to developing software with our Software...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...