Scribd
Upload
15 views2 pages

Experiment No - 8 Aim

The document describes an experiment to implement the Banker's algorithm for deadlock avoidance. It includes the source code for a C++ program that takes the allocation and maximum needs of processes and resources as input and outputs a safe sequence to prevent deadlock. The program successfully implements the Banker's algorithm.

Uploaded by

Paras Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views2 pages

Experiment No - 8 Aim

The document describes an experiment to implement the Banker's algorithm for deadlock avoidance. It includes the source code for a C++ program that takes the allocation and maximum needs of processes and resources as input and outputs a safe sequence to prevent deadlock. The program successfully implements the Banker's algorithm.

Uploaded by

Paras Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EXPERIMENT NO – 8

AIM : Write a program to implement Banker’s algorithm


for deadlock avoidance.
SOURCE CODE:
#include <iostream>
using namespace std;
int main(){
int n, m, i, j, k;
n = 5;
m = 3;
int alloc[5][3] = {{0,1,0},{2,0,0},{3,0,2},
{ 2,1,1},{0,0,2}};
int max[5][3] = {{ 7, 5, 3 },{3, 2, 2 },
{ 9, 0, 2},{2, 2, 2},{4, 3, 3}};
int avail[3] = { 3, 3, 2 };
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 << "Following is the SAFE Sequence" << endl;
for (i = 0; i < n - 1; i++)
cout << " P" << ans[i] << " ->";
cout << " P" << ans[n - 1] <<endl;
return (0);
}
RESULT : Programs for Banker’s algorithms for deadlock
avoidance was successfully implemented.

You might also like