Scribd
Upload
33 views3 pages

Bankers Algo

This C program implements the Banker's algorithm for deadlock avoidance in operating systems. It takes input for resource allocation and maximum matrices, calculates the need matrix, and identifies a safe sequence of processes that can complete without causing deadlock. The program initializes variables, inputs the number of resources and processes, takes the allocation and maximum matrices as input, calculates the need matrix, and uses the Banker's algorithm to find a safe sequence of processes that can run without deadlock.

Uploaded by

ORBIT GUY
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views3 pages

Bankers Algo

This C program implements the Banker's algorithm for deadlock avoidance in operating systems. It takes input for resource allocation and maximum matrices, calculates the need matrix, and identifies a safe sequence of processes that can complete without causing deadlock. The program initializes variables, inputs the number of resources and processes, takes the allocation and maximum matrices as input, calculates the need matrix, and uses the Banker's algorithm to find a safe sequence of processes that can run without deadlock.

Uploaded by

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

#include <stdio.

h>

#include <conio.h>

void main() {

int k=0,a=0,b=0,instance[5],availability[5],allocated[10][5],need[10][5],MAX[10]
[5],process,P[10],no_of_resources, cnt=0,i, j;

printf("\n Enter the number of resources : ");

scanf("%d", &no_of_resources);

printf("\n enter the max instances of each resources\n");

for (i=0;i<no_of_resources;i++) {

availability[i]=0;

printf("%c= ",(i+97));

scanf("%d",&instance[i]);

printf("\n Enter the number of processes : ");

scanf("%d", &process);

printf("\n Enter the allocation matrix \n ");

for (i=0;i<no_of_resources;i++)

printf(" %c",(i+97));

printf("\n");

for (i=0;i <process;i++) {

P[i]=i;

printf("P[%d] ",P[i]);

for (j=0;j<no_of_resources;j++) {

scanf("%d",&allocated[i][j]);

availability[j]+=allocated[i][j];

printf("\nEnter the MAX matrix \n ");


for (i=0;i<no_of_resources;i++) {

printf(" %c",(i+97));

availability[i]=instance[i]-availability[i];

printf("\n");

for (i=0;i <process;i++) {

printf("P[%d] ",i);

for (j=0;j<no_of_resources;j++)

scanf("%d", &MAX[i][j]);

printf("\n");

A: a=-1;

for (i=0;i <process;i++) {

cnt=0;

b=P[i];

for (j=0;j<no_of_resources;j++) {

need[b][j] = MAX[b][j]-allocated[b][j];

if(need[b][j]<=availability[j])

cnt++;

if(cnt==no_of_resources) {

P[k++]=P[i];

for (j=0;j<no_of_resources;j++)

availability[j]+=allocated[b][j];

} else

P[++a]=P[i];

}
if(a!=-1) {

process=a+1;

goto A;

printf("\t <");

for (i=0;i<k;i++)

printf(" P[%d] ",P[i]);

printf(">");

getch();

You might also like