bestfit.cpp

来自「its about page reeplacement technique in」· C++ 代码 · 共 56 行

#include<iostream>
#include<conio.h>
using namespace std;
int main()
{int freespace[10];
 int requestsize[10];
 int no_pages;
 cout<<"enter the free spaces";
int i,totalspace=0,totalrequest=0;
 for(i=0;i<10;i++)
{cin>>freespace[i];
 totalspace+=freespace[i];
 if(freespace[i]==0)
 break;
}
int k=i;
i++;

for(i;i<10;i++)
{freespace[i]=0;}

cout<<"\n enter the no of pages ";
cin>>no_pages;
cout<<"\n requests \n";
for(int j=0;j<no_pages;j++)
{cin>>requestsize[j];
 totalrequest+=requestsize[j];
}
int internal=0,external=0,min=9999,ind;
for(int j=0;j<no_pages;j++)
{for(int l=0;l<k;l++)
{if(requestsize[j]<=freespace[l])
 {if((freespace[l]-requestsize[j])<min)
   {min=freespace[l]-requestsize[j];
    ind=l;
    }
  }
}
if(min!=9999)
{
  internal+=min;
   freespace[ind]=0;
   min=9999;
}

}
cout<<"\n internal fragment "<<internal;
for(int y=0;y<10;y++)
{external+=freespace[y];
}
cout<<"\nexternal fragment "<<external<<"\n";
getch();
return 0;

}