1) Fcfs
1) Fcfs
h>
int main() {
int n, at[10], bt[10], wt[10], tat[10], ct[10], sum, i, j;
float total_tat = 0, total_wt = 0;
// Completion Time
sum = at[0];
for(j = 0; j < n; j++) {
sum += bt[j];
ct[j] = sum;
}
// Waiting Time
for(i = 0; i < n; i++) {
wt[i] = tat[i] - bt[i];
total_wt += wt[i];
}
// Display
printf("\nProcess\tAT\tBT\tCT\tTAT\tWT\n");
for(i = 0; i < n; i++) {
printf("P%d\t%d\t%d\t%d\t%d\t%d\n", i+1, at[i], bt[i], ct[i], tat[i],
wt[i]);
}
return 0;
}