Consider the Least Recently Used (LRU) page replacement policy. Assume that there are only 4 page slots available in the buffer pool. If a page reference sequence is: 7, 0, 1, 2, 0, 3, 0, 4 (in order from left to right). Which page is the first to be evicted from the buffer pool? 7 3 2 1 4
Consider the Least Recently Used (LRU) page replacement policy. Assume that there are only 4 page slots available in the buffer pool. If a page reference sequence is: 7, 0, 1, 2, 0, 3, 0, 4 (in order from left to right). Which page is the first to be evicted from the buffer pool? 7 3 2 1 4
Chapter11: Operating Systems
Section: Chapter Questions
Problem 1RP
Related questions
Question
CSC 472 Introduction to
Consider the Least Recently Used (LRU) page replacement policy.
Assume that there are only 4 page slots available in the buffer pool.
If a page reference sequence is: 7, 0, 1, 2, 0, 3, 0, 4 (in order from left to right).
Which page is the first to be evicted from the buffer pool?
7
3
2
1
4
0
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 2 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