Program16.c

#include<stdio.h>
int max[100][100];
int alloc[100][100];
int need[100][100];
int avail[100];
int n,r;
void input();
void show();
void cal();
int main()
{
	int i,j;
	printf("********** BANKER'S ALGORITHM ************\n");
	input();
	show();
	cal();
	return 0;
}
void input()
{
	int i,j;
	printf("Enter The Number Of Processes : ");
	scanf("%d",&n);
	printf("Enter The Number Of Resources Instances : ");
	scanf("%d",&r);
	printf("Enter The Max Matrix\n");
	for(i=0;i<n;i++) 
	{
		for(j=0;j<r;j++) 
		{
		scanf("%d",&max[i][j]);
		}
	}
	printf("Enter The Allocation Matrix\n");
	for(i=0;i<n;i++) 
	{
		for(j=0;j<r;j++) 
		{
			scanf("%d",&alloc[i][j]);
		}		
	}
	printf("Enter The Available Resources\n");
	for(j=0;j<r;j++) 
	{
		scanf("%d",&avail[j]);
	}
}
void show() 
{
	int i,j;
	printf("Process\t Allocation\t Max\t Available\t");
	for(i=0;i<n;i++) 
	{
		printf("\nP%d\t ",i+1);
		for(j=0;j<r;j++) 
		{
			printf("%d ",alloc[i][j]); 
		}
		printf("\t");
		for(j=0;j<r;j++) 
		{
			printf("%d ",max[i][j]); 
		}
		printf("\t");
		if(i==0) 
		{
			for(j=0;j<r;j++)
				printf("%d ",avail[j]);
		}
	}
}
void cal()
{
	int finish[100],temp,need[100][100],flag=1,k,c1=0;
	int safe[100];
	int i,j;
	for(i=0;i<n;i++) 
	{
		finish[i]=0;
	}
	for(i=0;i<n;i++) 
	{
		for(j=0;j<r;j++) 
		{
			need[i][j]=max[i][j]-alloc[i][j];
		}
	}
	printf("\n");
	while(flag) 
	{
		flag=0;
		for(i=0;i<n;i++) 
		{
			int c=0;
			for(j=0;j<r;j++) 
			{
				if((finish[i]==0)&&(need[i][j]<=avail[j])) 
				{
					c++;
					if(c==r) 
					{
						for(k=0;k<r;k++) 
						{
							avail[k]+=alloc[i][j];
							finish[i]=1;
							flag=1; 
						}
						printf("P%d->",i);
						if(finish[i]==1) 
						{
							i=n;
						}
					}
				}
			}
		}
	}
	for(i=0;i<n;i++) 
	{
		if(finish[i]==1) 
		{
			c1++;
		}
		else
		{
			printf("P%d->",i);
		}
	}
	if(c1==n)
	{
		printf("\n The System Is In Safe State.");
	}
	else
	{
		printf("\n Process Are In Deadlock.");
		printf("\n System Is In Unsafe State.");
	}
}