First Come First Served (FCFS)
Scheduling
Nama : DIANA PUTRI
THERESIA
NIM : 1114010080
#include<stdio.h>
int main()
{
int
n,bt[20],wt[20],tat[20],avwt=0,avtat=0,i,j;
printf("\n
Enter total number of processes(maximum 20):");
scanf("%d",&n);
printf("\n
Enter Process Burst Time:\n");
for(i=0;i<n;i++)
{
printf("P[%d]:",i+1);
scanf("%d",&bt[i]);
}
wt[0]=0; //waiting time for first process is 0
//calculating
waiting time
for(i=1;i<n;i++)
{
wt[i]=0;
for(j=0;j<i;j++)
wt[i]+=bt[j];
}
printf("\n
Processt \Burst Time\tWaiting Time\tTurnaround Time \n");
//calculating
turnaround time
for(i=0;i<n;i++)
{
tat[i]=bt[i]+wt[i];
avwt+=wt[i];
avtat+=tat[i];
printf("\n P[%d] \ %d \ %d \ %d
\n",i+1,bt[i],wt[i],tat[i]);
}
avwt/=i;
avtat/=i;
printf("\n
Average Waiting Time:%d",avwt);
printf("\n
Average Turnaround Time:%d",avtat);
return 0;
}
0 comments:
Post a Comment