OS EXP5 (1)
OS EXP5 (1)
Batch:C1 RollNo:33
Experiment No: 5
Program:
#include <stdio.h>
int main()
{
int n, bt[20], wt[20], tat[20], i, j;
float avwt = 0, avtat = 0;
printf("Enter total number of processes (maximum 20): ");
scanf("%d", &n);
printf("\nEnter Process Burst Time\n");
for (i = 0; i < n; i++)
{
printf("P[%d]: ", i + 1);
scanf("%d", &bt[i]);
}
wt[0] = 0;
for (i = 1; i < n; i++)
{
wt[i] = 0;
for (j = 0; j < i; j++)
wt[i] += bt[j];
}
printf("\nProcess\t\tBurst Time\tWaiting Time\tTurnaround Time\n");
for (i = 0; i < n; i++)
{
tat[i] = bt[i] + wt[i];
avwt += wt[i];
avtat += tat[i];
printf("\nP[%d]\t\t%d\t\t%d\t\t%d", i + 1, bt[i], wt[i], tat[i]);
}
avwt /= i;
avtat /= i;
printf("\n\nAverage Waiting Time: %f", avwt);
printf("\nAverage Turnaround Time: %f", avtat);
return 0;
}
Output:
Conclusion:
Thus we implemented FCFS CPU scheduling algorithm in C.