SCHEDULING ALGORITHMS - FIFO

FIRST COME FIRST SERVE (FIFO)

Previous Next

#include”stdio.h”
void main()
{
int i,n,sum,wt,tat,twt,ttat;
int t[10];
float awt,atat;
clrscr();
printf("\t\t\t\tSCHEDULING ALGORITHMS\n");
printf("\t\t ~~~~~~~~~~~~~~~~~~~~~\n");
printf("\t\t\tFIRST COME FIRST SERVE\n");
printf("Enter number of process:\n");
scanf("%d",&n);
for(i=0;i",i+1);
scanf("\n %d",&t[i]);
}
printf("\n\n FIRST COME FIRST SERVE SCHEDULING ALGORITHM\n ");
printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ \n");
printf("\n ProcessID \t WaitingTime \t TurnAroundTime \n\n");
printf(" 1 0 %d \n",t[0]);
sum=0;
twt=0;
ttat=t[0];
for(i=1;i

Previous Next