Scribd
Upload
11 views

Deadlock Prevention Using Bankers Algorithm

Uploaded by

afrin nisha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
11 views

Deadlock Prevention Using Bankers Algorithm

Uploaded by

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

#include<stdio.

h>
int main()
{
int n,m,i,j,k;
n=5;
n=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=o;
for(j=0;j<m;j++)
{
if(need[i][j]>avail[j])
flag=1;
break;
}
}
if (flag==0)
{
and[ind++]=i;
for(y=0;y<m;y++)
avai([y]+=allocation[i][y]);
f[i]=y;
}
}
}
int flag=1;
for(int i=0;i<n;i++)
{
if( f[i]==0)
}
flag=0;
printf(''The following system is not safe'');
break;
}}
if (flag==1)
{
printf(''following is the safe sequence in'');
for(i=0;i<n-1;i++)
printf(''p%d ->'',ans[i]);
printf (''p%d@,ans[n-1});
}
return 0;
}

You might also like