#include<stdio.h>
#include<conio.h>
int fr[3];
void main()
{
void display();
int p[12]={2,3,2,1,5,2,4,5,3,2,5,2},i,j,fs[3];
int index,k,l,flag1=0,flag2=0,pf=0,frsize=3;
clrscr();
for(i=0;i<3;i++)
{
fr[i]=-1;
}
for(j=0;j<12;j++)
{
flag1=0,flag2=0;
for(i=0;i<3;i++)
{
if(fr[i]==p[j])
{
flag1=1;
flag2=1;
break;
}
}
if(flag1==0)
{
for(i=0;i<3;i++)
{
if(fr[i]==-1)
{
fr[i]=p[j];
flag2=1;
break;
}
}
}
if(flag2==0)
{
for(i=0;i<3;i++)
fs[i]=0;
for(k=j-1,l=1;l<=frsize-1;l++,k--)
{
for(i=0;i<3;i++)
{
if(fr[i]==p[k])
fs[i]=1;
}
}
for(i=0;i<3;i++)
{
if(fs[i]==0)
index=i;
}
fr[index]=p[j];
pf++;
}
display();
}
printf("\n no of page faults :%d",pf);
getch();
}
void display()
{
int i;
printf("\n");
for(i=0;i<3;i++)
printf("\t%d",fr[i]);
}

OUTPUT :
 2 -1 -1
 2  3 -1
 2  3 -1
 2  3  1
 2  5  1
 2  5  1
 2  5  4
 2  5  4
 3  5  4
 3  5  2
 3  5  2
 3  5  2
 no of page faults : 4

• Pin It
• Share
• Tweet

Be Sociable, Share!

• 

Related posts:

1. C Program – Optimal Page Replacement Algorithm
2. C Program – Implement the midpoint circle drawing algorithm
3. How To Select All Text On a Page
4. C program to find the sum of all elements of an array using pointers as arguments
5. C Program – Midpoint Line algorithm

Tagged as: C program for LRU page replacement algorithm, LRU page replacement algorithm, page replacement algorithm