Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added Bankers Algorithm Problem #108

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
92 changes: 92 additions & 0 deletions Algorithm/BankersAlgorithm.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,92 @@
// Banker's Algorithm in C++
#include <iostream>
using namespace std;

// processes
const int P = 5;

// resources
const int R = 3;

void calculateNeed(int need[P][R], int maxm[P][R],
int allot[P][R])
{
for (int i = 0; i < P; i++)
for (int j = 0; j < R; j++)

// Need of instance = maxm instance - allocated instance
need[i][j] = maxm[i][j] - allot[i][j];
}

bool isSafe(int processes[], int avail[], int maxm[][R],
int allot[][R])
{
int need[P][R];
calculateNeed(need, maxm, allot);
bool finish[P] = {0};
int safeSeq[P];

int work[R];
for (int i = 0; i < R; i++)
work[i] = avail[i];

int count = 0;
while (count < P)
{
bool found = false;
for (int p = 0; p < P; p++)
{
if (finish[p] == 0)
{
int j;
for (j = 0; j < R; j++)
if (need[p][j] > work[j])
break;
if (j == R)
{
for (int k = 0; k < R; k++)
work[k] += allot[p][k];
safeSeq[count++] = p;
finish[p] = 1;

found = true;
}
}
}

if (found == false)
{
cout << "System is not in safe state";
return false;
}
}
cout << "System is in safe state.\nSafe"
" sequence is: ";
for (int i = 0; i < P; i++)
cout << safeSeq[i] << " ";

return true;
}

int main()
{
int processes[] = {0, 1, 2, 3, 4};

int avail[] = {2, 1, 0};

int maxm[][R] = {{4, 3, 3},
{3, 2, 2},
{9, 0, 2},
{7, 5, 3},
{1, 1, 2}};

int allot[][R] = {{1, 1, 2},
{2, 1, 2},
{4, 0, 1},
{0, 2, 0},
{1, 1, 2}};

isSafe(processes, avail, maxm, allot);

return 0;
}