Java/test.c at master · DiprajDebnath/Java · 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
98
99
100
101
102
103
104
105
106
107
108
#include<stdio.h>

struct roundRobin
{
      int pburst,pburst1, wtime, endtime, arrivt, boolean, flagcntl;
      char pname[5];
} a[5];

int n, tq;
void input();
void initialize();
void calculate();
void display_waittime();
int main()
{
      input();
      initialize();
      calculate();
      display_waittime();
      //getch();
      //return 0;
}
void input()
{
      int i;
      printf("Enter Total no. of processes\n");
      scanf("%d", &n);
      for (i = 0; i < n; i++)
      {
            printf("Enter process name:");
            scanf("%s", &a[i].pname);
            printf("Enter process burst time:");
            scanf("%d", &a[i].pburst);
            printf("Enter process arrival time:");
            scanf("%d", &a[i].arrivt);
      }
      printf("\nEnter the time quantum/Time Slice:");
      scanf("%d", &tq);
}
void initialize()
{
      int i;
      for (i = 0; i < n; i++)
      {
            a[i].pburst1 = a[i].pburst;
            a[i].wtime = 0;
            a[i].endtime = 0;
            a[i].boolean = 0;
            a[i].flagcntl = 0;
      }
}
void calculate()
{
      int i, j = 0, k = 0, flag = 1, count = 0;
      printf("\n---GANTT CHART---\n");
      printf("0 | ");
      while (flag)
      {
            for (i = 0; i < n; i++)
            {
                  if ((k < n) && (a[i].arrivt <= count) && (a[i].flagcntl == 0)) //calculating waiting time for firsttime
                        {
                              a[i].wtime = count - a[i].arrivt;
                              a[i].endtime = count;
                              a[i].boolean = 1;
                              a[i].flagcntl = 1;
                              k++;
                        }
                  if ((a[i].pburst1 > tq) && (a[i].arrivt <= count))
                  {
                        if (a[i].boolean == 1)
                              a[i].boolean = 0;
                        else
                              a[i].wtime = a[i].wtime + (count - a[i].endtime);
                        count = count + tq;
                        a[i].pburst1 = a[i].pburst1 - tq;
                        a[i].endtime = count;
                        printf("%d %s| ", count, a[i].pname);
                  }
                  else if ((a[i].pburst1 > 0) && (a[i].pburst1 <= tq) && (a[i].arrivt <= count))
                  {
                        if (a[i].boolean == 1)
                              a[i].boolean = 0;
                        else
                              a[i].wtime = a[i].wtime + (count - a[i].endtime);
                        count = count + a[i].pburst1;
                        a[i].endtime = count;
                        printf("%d %s| ", count, a[i].pname);
                        a[i].pburst1 = 0;
                        j++;
                  }
                  else if (j == n)
                        flag = 0;
            } //end of for loop
      } //end of while loop
}
void display_waittime()
{
      int i, tot = 0, turn = 0;
      for (i = 0; i < n; i++)
      {
            printf("\n\nWaiting time for Process %s is %d", a[i].pname, a[i].wtime);
            tot = tot + a[i].wtime;
            turn = turn + a[i].endtime - a[i].arrivt;
      }
      printf("\n\n\tAverage waiting time=%f", (float)tot / (float)n);
      printf("\n\tAverage turnaround time=%f\n", (float)turn / (float)n);
}