-
Notifications
You must be signed in to change notification settings - Fork 0
/
Priority.cpp
80 lines (67 loc) · 1.81 KB
/
Priority.cpp
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
#include<bits/stdc++.h>
using namespace std;
#define MAX_PROCESSES 10
struct Process
{
int pid;
int burst_time;
int priority;
int completion_time;
int waiting_time;
};
void swap(struct Process *xp, struct Process *yp)
{
struct Process temp = *xp;
*xp = *yp;
*yp = temp;
}
void sortProcesses(struct Process processes[], int n)
{
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
if (processes[j].priority > processes[j + 1].priority)
{
swap(&processes[j], &processes[j + 1]);
}
}
}
}
void priorityScheduling(struct Process processes[], int n)
{
int time = 0;
float total_waiting_time = 0;
cout << "Gantt Chart:" << endl;
cout << "0";
for (int i = 0; i < n; i++)
{
time += processes[i].burst_time;
processes[i].completion_time = time;
processes[i].waiting_time = time - processes[i].burst_time;
total_waiting_time += processes[i].waiting_time;
cout << " -- P" << processes[i].pid << " -- " << time;
}
cout << endl;
cout << "Average Waiting Time: " << (float)total_waiting_time / n << endl;
}
int main()
{
int n;
struct Process processes[MAX_PROCESSES];
cout << "Enter the number of processes: ";
cin >> n;
cout << "Enter burst time and priority for each process " << endl;
for (int i = 0; i < n; i++)
{
cout << "Process " << i + 1 << endl;
cout << "Burst time: ";
cin >> processes[i].burst_time;
cout << "Priority: ";
cin >> processes[i].priority;
processes[i].pid = i + 1;
}
sortProcesses(processes, n);
priorityScheduling(processes, n);
return 0;
}