CA-LAB-program-programs to simulate memory allocation policies First-fit algorithm

#include<iostream.h> 
void main() 
{ 
int mem[10],process[10],n1,n2,flags[10],allocation[10];
int i,;
for(i=0;i<10;i++)
{
flags[i]=0;
allocation[i]=-1;
}
cout<<"\nEnter No.of memory partitons:"; 
cin>>n1;
cout<<"\nEnter size of each partitions:"; 
for(i=0;i<n1;i++) 
cin>>mem[i];
cout<,"\nEnter No.of processes:";
cin>>n2; 
cout<<"\nEnter size of each process:"; 
for(i=0;i<n2;i++) cin>>processses[i]; 
//allocation as per first fit
for(i=0;i<n2;i++)
for(j=0;j<n1;j++)
if(flags[]==0 && mem[j]>=processes[i])
{allocations[j]=i;
flags[j]=1; 
break;
}
//displa allocation details
cout<<"\nPartitionsize process no. size";
for(i=0;i<n1;i++)
{
cout<<"\n"<<i<<" "<<mem[i]<<" "; 
if(flags[i]==1)
cout<<allocation[i]<," "<<processes[allocation[i]];
else
cout<<" "; 
}
}