Implement LRU (Least Recently Used) page replacement algorithm in Java. Below is the outline of the class LRU: Fields int size representing the size of the table int[][] table two dimensional array storing binary values (1's and O's) at each request int[] priority one dimensional array storing least recently used values for each page Methods LRU(int) constructor takes an integer as argument used to initialize field size; creates and initializes arrays table and priority. public void reference(int) sets specified row and column of table and computes priorities. public int findPage() returns index of the page that has least recently be used. public void print() prints table, priorities and index of the least recently used page.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Implement LRU (Least Recently Used) page replacement
algorithm in Java. Below is the outline of the class LRU:
Fields
int size representing the size of the table
int[][] table two dimensional array storing binary values (1's
and O's) at each request
int[] priority one dimensional array storing least recently
used values for each page
Methods
LRU(int) constructor takes an integer as argument used to
initialize field size; creates and initializes arrays table and
priority.
public void reference(int) sets specified row and column of
table and computes priorities.
public int findPage() returns index of the page that has least
recently be used.
public void print() prints table, priorities and index of the
least recently used page.
Transcribed Image Text:Implement LRU (Least Recently Used) page replacement algorithm in Java. Below is the outline of the class LRU: Fields int size representing the size of the table int[][] table two dimensional array storing binary values (1's and O's) at each request int[] priority one dimensional array storing least recently used values for each page Methods LRU(int) constructor takes an integer as argument used to initialize field size; creates and initializes arrays table and priority. public void reference(int) sets specified row and column of table and computes priorities. public int findPage() returns index of the page that has least recently be used. public void print() prints table, priorities and index of the least recently used page.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY