-
Notifications
You must be signed in to change notification settings - Fork 110
/
Copy pathfcfs.c
226 lines (206 loc) · 6.39 KB
/
fcfs.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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct
{
int pid;
int burst_time;
int arr_time;
int waiting_time;
int turnaround_time;
int completion_time;
} Process;
void print_table(Process p[], int n);
void print_gantt_chart(Process p[], int n);
int main()
{
Process p[MAX];
int i, j, n, burst=0, comp_T=0;
int sum_waiting_time = 0, sum_turnaround_time=0;
printf("Enter total number of process: ");
scanf("%d", &n);
printf("Enter Arrival time and Burst time of the process\n");
for(i=0; i<n; i++) {
p[i].pid = i+1;
printf("P[%d] : ", i+1);
scanf("%d", &p[i].arr_time);
scanf("%d", &p[i].burst_time);
}
for(i=0; i<n; i++)
{
if(i==0)
{
p[i].completion_time = p[i].burst_time + p[i].arr_time;
}
else
{
int arr=0;
if(p[i].arr_time > p[i-1].completion_time)
arr = p[i].arr_time-p[i-1].completion_time;
p[i].completion_time = p[i].burst_time + p[i-1].completion_time + arr;
}
p[i].turnaround_time=p[i].completion_time-p[i].arr_time;
sum_turnaround_time+=p[i].turnaround_time;
}
for(i=0; i<n; i++) {
p[i].waiting_time = p[i].turnaround_time-p[i].burst_time;
sum_waiting_time += p[i].waiting_time;
}
puts("");
print_table(p, n);
puts("");
printf("Total Waiting Time : %-2d\n", sum_waiting_time);
printf("Average Waiting Time : %-2.2lf\n", (double)sum_waiting_time / (double) n);
printf("Total Turnaround Time : %-2d\n", sum_turnaround_time);
printf("Average Turnaround Time : %-2.2lf\n", (double)sum_turnaround_time / (double) n);
puts("");
puts(" GANTT CHART ");
puts(" *********** ");
print_gantt_chart(p, n);
return 0;
}
void print_table(Process p[], int n)
{
int i;
puts("+-----+--------------+------------+-----------------+--------------+-----------------+");
puts("| PID | Arrival Time | Burst Time | Completion Time | Waiting Time | Turnaround Time |");
puts("+-----+--------------+------------+-----------------+--------------+-----------------+");
for(i=0; i<n; i++) {
printf("| %2d | %2d | %2d | %2d | %2d | %2d |\n"
, p[i].pid, p[i].arr_time, p[i].burst_time, p[i].completion_time, p[i].waiting_time, p[i].turnaround_time );
puts("+-----+--------------+------------+-----------------+--------------+-----------------+");
}
}
void print_gantt_chart(Process p[], int n)
{
// int i, j;
// // print top bar
// printf(" ");
// for(i=0; i<n; i++) {
// for(j=0; j<p[i].burst_time; j++) printf("--");
// printf(" ");
// }
// printf("\n|");
// // printing process id in the middle
// for(i=0; i<n; i++) {
// for(j=0; j<p[i].burst_time - 1; j++) printf(" ");
// printf("P%d", p[i].pid);
// for(j=0; j<p[i].burst_time - 1; j++) printf(" ");
// printf("|");
// }
// printf("\n ");
// // printing bottom bar
// for(i=0; i<n; i++) {
// for(j=0; j<p[i].burst_time; j++) printf("--");
// printf(" ");
// }
// printf("\n");
// // printing the time line
// printf("0");
// for(i=0; i<n; i++) {
// for(j=0; j<p[i].burst_time; j++) printf(" ");
// if(p[i].completion_time > 9) printf("\b"); // backspace : remove 1 space
// printf("%d", p[i].completion_time);
// }
// printf("\n");
int i, j, k;
int last = p[n-1].completion_time + ( n== 1 ? 0 : p[n-1].completion_time);
// printing top bar
printf(" ");
for(i=0; i<n; i++) {
k=0;
if(i==0)
{ for(k=0;k<p[i].arr_time;k++) printf("--");
printf(" ");
}
else
{ for(k=0;k<p[i].arr_time-p[i-1].completion_time;k++) printf("--");
if(p[i].arr_time-p[i-1].completion_time > 0)
printf(" ");
}
if(k<0)
k=0;
for(j=k; j<p[i].burst_time+k; j++) printf("--");
printf(" ");
}
printf("\n|");
// middle position
int flag=0;
for(i=0; i<n; i++) {
flag=0;
k=0;
if(i==0){
for(k=0;k<p[i].arr_time;k++) printf(" ");
printf("|");
flag=1;
}
else
{
for(k=0;k<p[i].arr_time-p[i-1].completion_time;k++) printf(" ");
if(p[i].arr_time-p[i-1].completion_time > 0){
printf("|");
flag=1;}
}
if(k<0)
k=0;
for(j=k; j<p[i].burst_time-1+k; j++) printf(" ");
printf("p%d", p[i].pid);
for(j=k; j<p[i].burst_time-1+k; j++) printf(" ");
printf("|");
}
printf("\n ");
// bottom bar
for(i=0; i<n; i++) {
k=0;
if(i==0)
{
for(k=0;k<p[i].arr_time;k++) printf("--");
printf(" ");
}
else
{ for(k=0;k<p[i].arr_time-p[i-1].completion_time;k++) printf("--");
if(p[i].arr_time-p[i-1].completion_time > 0)
printf(" ");
}
if(k<0)
k=0;
for(j=k; j<p[i].burst_time+k; j++) printf("--");
printf(" ");
}
printf("\n");
// printing waiting time
printf("0");
int minus = 0;
for(i=0; i<n; i++) {
k=0;
if(i==0)
{
for(k=0;k<p[0].arr_time;k++) printf(" ");
printf("%d", p[0].arr_time);
}
else
{
for(k=0;k<p[i].arr_time-p[i-1].completion_time;k++) printf(" ");
if(p[i].arr_time-p[i-1].completion_time > 0)
printf("%d", p[i].arr_time);
}
// if(p[i].completion_time>9) printf(" ");
if(k<0)
k=0;
// for(j=k; j<p[i].burst_time-minus+k; j++) printf(" ");
// printf("%d", p[i].completion_time);
// if(p[i+1].completion_time>9){
// minus = 1;
// }
// if(i+1 == n ) if (last>9) minus = 1;
if(p[i].completion_time>9) printf(" ");
if(p[i].completion_time > 9) printf("\b");
for(j=k;j<p[i].burst_time-minus+k;j++) printf(" ");
if(i+1 <= n)
{
if(p[i].completion_time > 9 && p[i+1].completion_time > 9)
printf("\b");
}
printf("%d",p[i].completion_time);
}
}