/* Simulate the following cpu scheduling algorithms.
C. First come First serve(fcfs) */
#include<stdio.h>
#include<conio.h>
void main()
{
int i,bt[10],n,twt=0,z[20];
int wt[10],sum=0,sum1=0;
float avgt=0.00;
clrscr();
printf("\n Enter no. of Processes ::");
scanf("%d",&n);
printf("\n Enter the %d burst times::",n);
for(i=0;i<n;i++)
{
printf("\n\n Enter time for process%d::",i+1);
scanf("%d",&bt[i]);
}
for(i=0;i<n;i++)
{
if(i==0)
{
wt[i]=0;
sum=sum+bt[i];
}
else
{
wt[i]=sum;
sum=sum+bt[i];
}
sum1=sum1+bt[i];
z[i]=sum1;
}
printf("\n\n----------------------------------------------\n");
printf("\n\tPNo\tbt\twt\n");
printf("\n----------------------------------------------\n");
for(i=0;i<n;i++)
{
twt+=wt[i];
printf("\n\n\tP%d\t%d\t%d\n",i+1,bt[i],wt[i]);
}
printf("\n----------------------------------------------\n");
avgt=(float)twt/(float)n;
printf("\n\nGannt Chart ::\n\n");
printf("\t0");
for(i=0;i<n-1;i++)
printf("%4d",z[i]);
printf("\n\n Total waiting time is ::%d",twt);
printf("\n\n Average waiting time is ::%f",avgt);
getch();
}
/*Input and OutPut:-
Enter no. of Processes ::3
Enter the 3 burst times::
Enter time for process1::24
Enter time for process2::3
Enter time for process3::3
----------------------------------------------
PNo bt wt
----------------------------------------------
P1 24 0
P2 3 24
P3 3 27
----------------------------------------------
Gannt Chart ::
0 24 27
Total waiting time is ::51
Average waiting time is ::17.000000 */
No comments:
Post a Comment