1. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced? a.)Optimal b.)LRU c.)Second chance d.)Clock 2. In memory management with valid–invalid bit, the valid bit indicates that the page is: a.) illegal access. b.)not in memory c.)in memory. d.)not legal.
1. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced? a.)Optimal b.)LRU c.)Second chance d.)Clock 2. In memory management with valid–invalid bit, the valid bit indicates that the page is: a.) illegal access. b.)not in memory c.)in memory. d.)not legal.
Chapter11: Operating Systems
Section: Chapter Questions
Problem 2VE
Related questions
Topic Video
Question
1. Which
a.)Optimal
b.)LRU
c.)Second chance
d.)Clock
2. In memory management with valid–invalid bit, the valid bit indicates that the page is:
a.) illegal access.
b.)not in memory
c.)in memory.
d.)not legal.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning