-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfcfswarr.c
87 lines (86 loc) · 1.72 KB
/
fcfswarr.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include<stdio.h>
#include<conio.h>
int main(){
int i,j,n,temp,a[10],b[10],p[10],ta[10],w[10],r[10],c[10],f[10];
float tasum=0,wsum=0,rsum=0,taavg,wavg,ravg;
printf("Enter number of processes:");
scanf("%d",&n);
printf("Enter the burst times:");
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
p[i]=i;
}
printf("Enter the arrival times");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++)
{
for(j=0;j<n-i-1;j++)
{
if(a[j]>=a[j+1])
{
if(a[j]==a[j+1])
if(p[j]<=p[j+1])
continue;
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
temp=p[j];
p[j]=p[j+1];
p[j+1]=temp;
temp=b[j+1];
b[j+1]=b[j];
b[j]=temp;
}
}
}
for(i=0;i<n;i++)
printf("%d\t",p[i]);
printf("\n");
c[0]=a[0]+b[0];
for(i=1;i<n;i++)
{
if(c[i-1]<a[i])
c[i]=a[i]+b[i];
else
c[i]=c[i-1]+b[i];
}
for(i=0;i<n;i++)
{
if(i==0)
f[i]=a[i];
else if(c[i-1]<a[i])
f[i]=a[i];
else
f[i]=c[i-1];
}
for(i=0;i<n;i++)
{
ta[i]=c[i]-a[i];
tasum+=ta[i];
}
for(i=0;i<n;i++)
{
w[i]=ta[i]-b[i];
wsum+=w[i];
}
for(i=0;i<n;i++)
{
r[i]=f[i]-a[i];
rsum+=r[i];
}
taavg=tasum/n;
wavg=wsum/n;
ravg=rsum/n;
printf("Process\tBurst\tArrival\tTurnaround\tWaiting\tResponse\n");
for(i=0;i<n;i++)
{
printf("%d\t%d\t%d\t%d\t\t%d\t%d\n",p[i]+1,b[i],a[i],ta[i],w[i],r[i]);
}
printf("Average TurnAround Time:%f\n",taavg);
printf("Average Waiting Time:%f\n",wavg);
printf("Average Response Time:%f\n",ravg);
}