Program in c for PAGE REPLACEMENT ALGORITHM OF FIFO...
Here FIFO stands for First In First Out. DESCRIPTION:- I am taking a example for better understanding of the fifo
algorithm. Lets suppose
Our page reference stream is:
0 1 2 3 0 1 4 0 1 2 3 4
A 0 0 0 3 3 3 4 4 4 4 4 4
B 1 1 1 0 0 0 0 0 2 2 2
C 2 2 2 1 1 1 1 1 3 3
SOURCE CODE:-
include<stdio .h>
int main()
{
int i,j,n,a[50],f[10],n1,k,avail,count=0;
printf("\n ENTER THE NUMBER OF PAGES:\n");
scanf("%d",&n);
printf("\n ENTER THE PAGE NUMBER :\n");
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("\n ENTER THE NUMBER OF FRAMES :");
scanf("%d",&n1);
for(i=0;i<n1;i++)
f[i]= -1;
j=0;
printf("\treference string\t page frames\n");
for(i=1;i<=n;i++)
{
printf("%d\t\t",a[i]);
avail=0;
for(k=0;k<n1;k++)
if(f[k]==a[i])
avail=1;
if (avail==0)
{
f[j]=a[i];
j=(j+1)%no;
count++;
for(k=0;k<n1;k++)
printf("%d\t",f[k]);
}
printf("\n");
}
printf("Page Fault Is %d",count);
return 0;
}
/*
THANKU.
Here FIFO stands for First In First Out. DESCRIPTION:- I am taking a example for better understanding of the fifo
algorithm. Lets suppose
Our page reference stream is:
0 1 2 3 0 1 4 0 1 2 3 4
A 0 0 0 3 3 3 4 4 4 4 4 4
B 1 1 1 0 0 0 0 0 2 2 2
C 2 2 2 1 1 1 1 1 3 3
SOURCE CODE:-
include<stdio .h>
int main()
{
int i,j,n,a[50],f[10],n1,k,avail,count=0;
printf("\n ENTER THE NUMBER OF PAGES:\n");
scanf("%d",&n);
printf("\n ENTER THE PAGE NUMBER :\n");
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("\n ENTER THE NUMBER OF FRAMES :");
scanf("%d",&n1);
for(i=0;i<n1;i++)
f[i]= -1;
j=0;
printf("\treference string\t page frames\n");
for(i=1;i<=n;i++)
{
printf("%d\t\t",a[i]);
avail=0;
for(k=0;k<n1;k++)
if(f[k]==a[i])
avail=1;
if (avail==0)
{
f[j]=a[i];
j=(j+1)%no;
count++;
for(k=0;k<n1;k++)
printf("%d\t",f[k]);
}
printf("\n");
}
printf("Page Fault Is %d",count);
return 0;
}
/*
THANKU.
0 comments:
Post a Comment