-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathLRU.c
103 lines (86 loc) · 1.82 KB
/
LRU.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include<stdio.h>
void main()
{
int n,p;
int i,j,k;
print("Enter the No of element of series: ");
scanf("%d", &n);
int series[n];
print("Enter the series: ");
for(i=0;i<n;i++)
{
scanf("%d", &series);
}
print("Enter the size of Page Slot: ");
scanf("%d", &p);
int page[p];
int prio[p];
for(i=0;i<p;i++)
{
page[i] = -1;
prio[i] = 1;
print("page slot : %d", page[i]);
print("Priority : %d", prio[i]);
}
int index =0;
int flag =1;
int curr = 0'
int pageFault =0;
for(i=0;i<n;i++)
{
flag =1;
for(j=0;j<p;j++])
{
if(series(i)==page(j))
{
flag =0;
curr =j;
break;
}
}
if(flag==1)
{
print("Priority \n");
for(k=0;k<p;k++)
{
print("%d", prio[k]);
}
print("\n");
for(j=0;j<p;j++)
{
if(prio[j]==1)
{
index =j;
break;
}
}
page[index] = series[i];
for(j=0;j<p;j++)
{
if(prio[j]<p&&prio[j]>1)
{
prio[j]-=1;
}
}
prio[index] = p;
pageFault++;
for(j=0;j<p;j++)
{
printf("%d", page[j]);
}
print("\n");
}
if(flag==0)
{
for(j=0;j<p;j++)
{
if(prio[j]>prio[curr])
{
prio[j]-=1;
}
}
prio[curr] = p;
}
print("Page Falts: %d", pageFault);
}
}