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

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter11: Operating Systems
Section: Chapter Questions
Problem 1RP
icon
Related questions
Question

CSC 472 Introduction to Database Systems Project

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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Properties of Different Architectures
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning