-
Notifications
You must be signed in to change notification settings - Fork 88
/
banker.c
82 lines (80 loc) · 2.06 KB
/
banker.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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
Deletion in Linked List
Author: PRINCE CHANDAPILLAI
Date Modified: 30th October 2021
*/
#include <stdio.h>
void main()
{
int i, j, k, n, m, safe[10], ind = 0, f[10];
int alloc[10][10], max[10][10], avail[10];
printf("Enter the number of processes\n");
scanf("%d", &n);
printf("Enter the number of resources \n");
scanf("%d", &m);
printf("Enter the CURRENT STATUS OF allocated resources of Every Process\n");
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
printf("Enter the %dth process of %d resources\n", i + 1, j + 1);
scanf("%d", &alloc[i][j]);
}
}
printf("Enter the MAXIMUM NEED OF allocated resources of Every Process\n");
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
printf("Enter the %dth process of %d resources\n", i + 1, j + 1);
scanf("%d", &max[i][j]);
}
}
printf("Enter the AVAILIABLE COUNT FOR EACH RESOURCE\n");
for (i = 0; i < m; i++)
{
printf("Enter the availiable number of RESOURCE type %d\n", i + 1);
scanf("%d", &avail[i]);
f[i] = 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)
{
safe[ind++] = i;
for (y = 0; y < m; y++)
avail[y] += alloc[i][y];
f[i] = 1;
}
}
}
}
printf("SAFE SEQUENCE\n");
for (i=0;i<ind;i++)
{
printf("P%d -> ", safe[i]);
}
printf("P%d", safe[ind-1]);
}