ACMAJCE/FCFS.c at main · ForAjce/ACMAJCE · GitHub

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
88
89
90
91
92
93
94
95
96
97
#include<stdio.h>
void main()
{
int i,j,l,s;
float z,x;
printf("Enter the number of processes: ");
scanf("%d",&l);
int a[20][20];
for(i=0;i<l;i++)
{
    printf(" Arrival time of process %d: ",i);
    scanf("%d",&a[i][1]);
    printf(" Burst time of process %d: ",i);
    scanf("%d",&a[i][2]);
    a[i][0]=i;

}a[0][0]=0;
s=l;
i=0;
while(l>=0){
     for(i=0;i<l;i++){
    if(a[i][1]>a[i+1][1])
    {
        int t1,t2,t3;
        t1=a[i][0];
        t2=a[i][1];
        t3=a[i][2];
        a[i][0]=a[i+1][0];
        a[i][1]=a[i+1][1];
        a[i][2]=a[i+1][2];
        a[i+1][0]=t1;
        a[i+1][1]=t2;
        a[i+1][2]=t3;


    }
    }
    l--;}
int wt[s],tat[s],w,t,c[s];
w=t=0;
wt[0]=0;


for(i=0;i<s;i++)
{if(wt[i]<a[i][1])
    wt[i+1]=a[i][1]+a[i][2];
    else
        wt[i+1]=wt[i]+a[i][2];
}


for(i=0;i<s;i++)
{
    tat[i]=wt[i]+a[i][2];
}

printf("process \t AT \t BT \t WT \t TAT  \n");


for(i=0;i<s;i++)
{
    printf(" P%d \t \t %d \t %d \t %d \t %d \n",a[i][0],a[i][1],a[i][2],wt[i],tat[i]);

   w=w+wt[i];
    t=tat[i]+t;
}
printf("\n \n ");
printf("  ");


printf("\n");
printf("  |");
for(i=0;i<s;i++)
    printf("      p%d      |",a[i][0]);

printf("\n");


printf("               ");

printf("\n  0");

for(i=0;i<s;i++)
    printf("              %d",wt[i+1]);


printf("\n \n ");

z=w/s;
x=t/s;
printf("Average Waiting Time    = %f \n",z);
printf("Average Turn-Around Time   = %f",x);
}