-
Notifications
You must be signed in to change notification settings - Fork 1
/
Bankers_algorithm_2.cpp
81 lines (63 loc) · 1.46 KB
/
Bankers_algorithm_2.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
81
// Banker's Algorithm
#include <iostream>
using namespace std;
int main()
{
int n, m, i, j, k;
cout<<"\nEnter the no of processes: ";
cin>>n;
cout<<"\nEnter the no of resources: ";
cin>>m;
int alloc[n][m] , max[n][m] , avail[m];
cout<<"\nEnter the ALLOCATION matrix : \n";
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
cin>>alloc[i][j];
}
printf("\nEnter the MAX matrix : \n");
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
cin>>max[i][j];
}
printf("\nEnter the AVAILABLE matrix : \n");
for (i = 0; i < m ; i++)
{
cin>>avail[i];
}
int f[n], ans[n], ind = 0;
for (k = 0; k < n; k++) {
f[k] = 0;
}
int need[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++)
need[i][j] = max[i][j] - alloc[i][j];
}
int y = 0;
for (k = 0; k < 5; k++) {
for (i = 0; i < n; i++) {
if (f[i] == 0) {
int flag = 0;
for (j = 0; j < m; j++) {
if (need[i][j] > avail[j]){
flag = 1;
break;
}
}
if (flag == 0) {
ans[ind++] = i;
for (y = 0; y < m; y++)
avail[y] += alloc[i][y];
f[i] = 1;
}
}
}
}
cout << "\nFollowing is the SAFE Sequence\n" << endl;
for (i = 0; i < n - 1; i++)
cout << " P" << ans[i] << " ->";
cout << " P" << ans[n - 1] <<endl;
return (0);
}