-
Notifications
You must be signed in to change notification settings - Fork 0
/
4.Round Robin.c
68 lines (68 loc) · 1.85 KB
/
4.Round Robin.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
// Program to Implement Round Robin
// Rohit Kumar | 1900320100131
#include <stdio.h>
void main()
{
int n, q;
// STDIN
printf("No of Process : ");
scanf("%d", &n);
int AT[n], BT[n], CT[n], WT[n], TAT[n], RBT[n];
printf("Enter the AT & BT of Process\n");
for (int i = 0; i < n; i++)
{
printf("P[%d]\t", i);
scanf("%d%d", &AT[i], &BT[i]);
}
printf("\nEnter Quantum : ");
scanf("%d", &q);
// PROCESSING
float AvgWT = 0.0;
float AvgTAT = 0.0;
int sum = 0;
// Loop for Calculation of Sum of Burst Time and Copy Burst time to Rough Burst Time
for (int i = 0; i < n; i++)
{
RBT[i] = BT[i];
sum = sum + BT[i];
}
int time = 0;
while (time < sum) //To Check if the total time is less than sum
{
for (int i = 0; i < n; i++)
{
if (RBT[i] != 0)
{
if (RBT[i] >= q)//If Busrt Time is More or Equal to Quantum
{
RBT[i] = RBT[i] - q;
time = time + q;
if (RBT[i] == 0)
CT[i] = time;
}
else//If Burst Time is Less than Quantum
{
time = time + RBT[i];
RBT[i] = 0;
CT[i] = time;
}
}
}
}
// Calculations
for (int i = 0; i < n; i++)
{
WT[i] = CT[i] - BT[i];
TAT[i] = CT[i];
AvgTAT += TAT[i];
AvgWT += WT[i];
}
AvgWT = AvgWT / n;
AvgTAT = AvgTAT / n;
// STDOUT
printf("\n\t\tAT\tBT\tWT\tTAT\n");
for (int i = 0; i < n; i++)
printf("P[%d]\t%d\t%d\t%d\t%d\n", i, AT[i], BT[i], WT[i], TAT[i]);
printf("\nAverage Waiting Time is %f Units\n", AvgWT);
printf("Average Turn Around Time is %f Units", AvgTAT);
}