code FCFS Header file for Cpu scheduling

code FCFS Header file for Cpu scheduling

//Shortest job First Algorithm

if(B[j-1]>B[j]){

temp=B[j-1];B[j-1]=B[j];B[j]=temp;}

}}

temp=B[j-1];temp1=A[j-1];B[j-1]=B[j];A[j-1]=A[j];B[j]=temp;

}}

i=2;

while(i<=n){

if(S[i]=='T'&&A[i]<=t){

Wt[i]=w;

S[i]='F';w=w+B[i];t=w;

i=2;

}else

i++;

}}

cout<<"Total Weighting Time="<<Twt<<"

";

cout<<"Average Weighting Time="<<Awt<<"

";

i=1;

while(i<=n){

if(P[i]==j){

Wt[i]=w;

w=w+B[i];

}i++;

}j++;

void cpuschedule::SjfP()

{

int i,j,m,Wt[10],k,B[10],A[10],Tt=0,Wtm[10],temp;char S[20],start[20];

cout<<"

Wt["<<i<<"]="<<Wt[i];

}B[i]=B[i]-1;

Wt[i]=Wt[i]-w;i=j;

}else{

flag=1;

}j++;

flag=0;

i=j;

}j++;

}

}

if(flag==0)i++;

if(min>B[i] && S[i]=='T'){

min=B[i];

}i++;

}i=j;

if(w==Time && start[i]=='T'){

w=w+B[i];

S[i]='F';

}else{

Wt[i]=Wt[i]+w;w=w+B[i];

S[i]='F';

}}

int m;

}}

//placing value in the Rrobin arrayi=1;

B[i]=B[i]-tq;Rrobin[i][j]=tq;j++;

}else{

Rrobin[i][j]=B[i];B[i]=0;

j++;

}}

count[i]=j-1;

i++;

}

cout<<"Display

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

{

for(j=1;j<=m;j++){

cout<<"Rr["<<i<<","<<j<<"]="<<Rrobin[i][j];cout<<"";

}cout<<"

Wt[x]=Wt[x]+Rrobin[a][i];

}i=1;

int z=x;

j=count[z];

k=1;

while(k<=j-1)

if(i==n+1){

i=1;

k++;

}else{

if(i!=z){

Wt[z]=Wt[z]+Rrobin[i][k];}

i++;

}}

x++;

}

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

cout<<"

Weighting Time for process P"<<i<<"="<<Wt[i];

//calculating Average Weighting Time

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

Twt=Twt+Wt[i];

Awt=Twt/n;

";