LRU Implementtion
Given:
N: no of elements
S: max. capacity of cache
a[i]: N no. of integers
Output:
PF: No. of page faults.
State of LRU cache.
Page falut occures when the element is not found in the cache.
In LRU algo , the least recently elements is removed first when no free space is avalaible in cache.
Input Format
N: no of elements
S: max. capacity of cache
a[i]: N no. of integers
Constraints
N ,S & a[i] all are integers
Output Format
PF:page fault
elements in LRU cache.
Sample Input
10 4
1 2 3 2 5 3 4 5 8 9
Sample Output
7
9 8 5 4
Explanation
Initially cache will be empty.
1 _ _ _ 1
2 1 _ _ 2
3 2 1 _ 3
2 3 1 _ 3
5 2 3 1 4
3 5 2 1 4
4 3 5 2 5
5 4 3 2 5
8 5 4 3 6
9 8 5 4 7
therefore: pagefaults = 7. state : 9 8 5 4.
xxxxxxxxxx1
with Ada.Text_IO, Ada.Integer_Text_IO;2
use Ada;3
4
procedure Solution is5
-- Enter your code here. Read input from STDIN. Print output to STDOUT6
7
8
end Solution