Comments on: C Program for Optimal Page Replacement Algorithm

By: todd

todd — Thu, 26 Apr 2012 08:26:27 +0000

the no. of page faults is actually 6….but in the code the initial faults are not counted ie the code is correct thats all i wanna say

By: sarada

sarada — Wed, 08 Feb 2012 01:51:30 +0000

than q for the code……………..
and no of page faults is not correct………….hav to check
3 is no of frames

By: vishnu

vishnu — Mon, 06 Feb 2012 11:08:05 +0000

i love you..you really saved my life..you know this really helped me alot

By: Anuja

Anuja — Mon, 14 Nov 2011 17:25:28 +0000

thank you soooo much..
u r lifesaver…

By: BiPiN

BiPiN — Tue, 01 Nov 2011 17:23:10 +0000

this program work fine
#include
#include
void main()
{
int a[5],b[20],p=0,q=0,m=0,h,k,i,q1=1,j,n;
char f=’F';
clrscr();
printf(“Enter the number of page:”);
scanf(“%d”,&n);
printf(“enter the number”);
for(i=0;i scanf("%d",&b[i]);
for(i=0;i=3)
q=0;
a[q]=b[i];
q++;
if(q1<3)
{
q1=q;
}
}
printf("\n%d",b[i]);
printf("\t");
for(h=0;h%c”,f);
m++;
}
p=0;
for(k=0;k {
if(b[i+1]==a[k])
p=1;
}
}
printf("\nNo of faults:%d",m);
getch();
}

By: kamakukka

kamakukka — Fri, 30 Sep 2011 16:03:22 +0000

orei chetta na kodakallara , telvakapothe madda musukuni gudda denginchukondi. ante gani me sullilu maa notlo pettalani try cheyadhu..

By: AKSHAY SAXENA

AKSHAY SAXENA — Sun, 10 Apr 2011 06:17:00 +0000

Pllzz lemme know whether the original post can be used for the implementation or not???

By: Surya

Surya — Sat, 26 Mar 2011 11:49:44 +0000

the no. of page faults is not 3
3 is the number of frames

By: Uday Sagar

Uday Sagar — Wed, 16 Mar 2011 16:31:02 +0000

//****this works fine****
#include
#include
void main()
{
int x,n,q2[10],i,f,j=0,k,pf=0,c=0,h,m,b=0;
char q[10],s[20] ;
clrscr();
printf(“\nenter :\n”);
scanf(“%s”,&s);
n=strlen(s);
printf(“enter the no. of frames:\n”);
scanf(“%d”,&f);
s[n+1]=”;
for(i=0;i {
q[i]='';
q2[i]=0;
}

for(i=0;i {
c=0;
for(k=0;k if(s[i]==q[k])
c++;
if(c==0)
{ if(q[f-1]=='')
{
q[j]=s[i];
pf++;
j++;
if(j==f)
j=0;
}
else
{
for(k=0;k {b=0;
for(x=i+1;x {
if(b==0)
if(q[k]==s[x])
{q2[k]=x;
b++;
}
}
if(q2[k]==0)
q2[k]=n;
}
j=0;
for(k=1;k if(q2[j] j=k;
for(k=0;k q2[k]=0;
q[j]=s[i];
pf++;
}
}
for(m=0;m printf("%c ",q[m]);
printf("\n");
}
printf("\nfinal queue is:\n\t\t");

for(m=0;m printf("\n%c",q[m]);

printf("\ntotal pf is: %d",pf);
printf("\npf due to replacement is: %d",pf-f);
getch();
}

By: Yassine

Yassine — Sat, 19 Feb 2011 11:27:34 +0000

Yes plz help us==> guess some thing wrong !! Number of faults is not true even i
tryed an other pages’s refenerement but DOESn’t mutch