FIFO Replacement Paging Algorithm

 /* Program to implement FIFO Replacement Paging Algorithm */

#include<stdio.h>

int main()

{

int i,j,n,a[50],frame[10],no,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",&no);

for(i=0;i<no;i++)

frame[i]= -1;

j=0;

printf("\tref string\t page frames\n");

for(i=1;i<=n;i++)

{

printf("%d\t\t",a[i]);

avail=0;

for(k=0;k<no;k++)

if(frame[k]==a[i])

avail=1;

if (avail==0)

{

frame[j]=a[i];

j=(j+1)%no;

count++;

for(k=0;k<no;k++)

printf("%d\t",frame[k]);

}

printf("\n");

}

printf("Page Fault Is %d",count);

FIFO Replacement Paging Algorithm

return 0;

}

-----------------------------------------------------------------------------

OUTPUT:

guest-stEO95@computer-OptiPlex-745:~$ gedit fifo.c

guest-stEO95@computer-OptiPlex-745:~$ cc fifo.c

guest-stEO95@computer-OptiPlex-745:~$ ./a.out

ENTER THE NUMBER OF PAGES:

9

ENTER THE PAGE NUMBER :

1

2

6

5

3

4

8

9

7

ENTER THE NUMBER OF FRAMES :3

ref string page frames

1 1 -1 -1

2 1 2 -1

6 1 2 6

5 5 2 6

3 5 3 6

4 5 3 4

8 8 3 4

9 8 9 4

7 8 9 7

guest-stEO95@computer-OptiPlex-745:~$