Skip to content

Execution/Implementation of LRU (Least Recently Used) Algorithm in C

Notifications You must be signed in to change notification settings

Cizr/LRU-Algorithm-in-C

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

To write a c program to implement LRU page replacement algorithm

LRU :

the page which is least recently used is replaced. Therefore, in memory, any page that has been unused for a longer period of time than the others is replaced.

Inputs required :

  1. the number of pages
  2. the reference string
  3. number of frames

Output :

  1. Number of pages
  2. Value of pages
  3. The frames
  4. Number of page faults

About

Execution/Implementation of LRU (Least Recently Used) Algorithm in C

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages