no of page faults : 3

#include
#include
   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 max,found=0,lg[3],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++)
			  lg[i]=0;
			      for(i=0;i
OUTPUT :

2 -1 -1

2  3 -1

2  3 -1

2  3  1

2  3  5

2  3  5

4  3  5

4  3  5

4  3  5

2  3  5

2  3  5

2  3  5
no of page faults : 3
The post C Program for Optimal Page Replacement Algorithm first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/c-tutorials/c/c-program-for-optimal-page-replacement-algorithm/feed/
			20