page replacement algorithms programs (1)
page replacement algorithms programs (1)
#include<stdio.h>
void main()
{
int p[20],i,j=0,k,l=0,n,m,q[5],fault=0,z=0;
printf("Enter No. of Pages: ");
scanf("%d",&n);
printf("Enter Pages: ");
for(i=0;i<n;i++)
scanf("%d",&p[i]);
printf("Enter No. of Frames: ");
scanf("%d",&m);
for(i=0;i<m;i++)
q[i]=-1;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
if(p[i]==q[j])
z++;
if(z==0)
{
fault++;
l=l%m;
q[l]=p[i];
l++;
z=0;
for(k=0;k<m;k++)
printf("%d\t",q[k]);
printf("\n");
}
z=0;
}
printf("Number of Page faults: %d",fault);
}
OUTPUT:
Enter No. of Pages: 8
Enter Pages: 7 0 1 2 0 3 0 4
Enter No. of Frames: 3
7 -1 -1
7 0 -1
7 0 1
2 0 1
2 3 1
2 3 0
4 3 0
Number of Page faults: 7
****
#include<stdio.h>
void main()
{
int p[20],i,j=0,k,l=0,n,m,q[5],fault=0,z=0,x[3],max=0,c,b,a;
OUTPUT:
Enter No. of Pages: 10
Enter Pages: 7 0 1 2 0 3 0 4 2 3
Enter No. of Frames: 3
7 -1 -1
7 0 -1
7 0 1
2 0 1
2 0 3
4 0 3
4 0 2
4 3 2
No. of Page Faults: 8
****
#include<stdio.h>
void main()
{
int p[20],i,j=0,k,l=0,n,m,q[5],fault=0,z=0,x[3],max=0,c,b,a;
OUTPUT:
Enter No. of Pages: 8
Enter Pages: 7 0 1 2 0 3 0 4
Enter No. of Frames: 3
7 -1 -1
7 0 -1
7 0 1
2 0 1
3 0 1
4 0 1
No. of Page faults: 6