asd

// PROGRAM FOR THE IMPLEMENTATION OF THE BANKER'S ALGORITHM //i.e to find safe or unsafe state #include<stdio.h> #define SIZE 20 int need[SIZE][SIZE],alloc[SIZE][SIZE],max[SIZE][SIZE]; int total[SIZE],avail[SIZE]; int main() {  int n1,n2,i,j,flag,flag1,flag2,result;  int check[SIZE]={0};  printf("\n\tEnter the number of processes\t");  scanf("%d",&n1);  printf("\n\tEnter the number of resources\t");  scanf("%d",&n2);  for(i=0;i<n2;i++)  {    printf("\n\tEnter the maximum number of instances of resource R%d\t",i+1);    scanf("%d",&total[i]);  }  //input  for(i=0;i<n1;i++)   {      for(j=0;j<n2;j++)       {      printf("\n\tEnter maximum number of instances of resource R%d needed to process P%d\t ",j+1,i+1);      scanf("%d",&max[i][j]);       }   }  for(i=0;i...