Question

(The code should be in C) You should invoke your program by passing the number of available resources of each type on the command line.

Ex)

./a.out 3 3 2

Input: Your program will read two files:

1) containing the maximum number of each resources,

2) containing the allocation number of each resources.

Output: 1) Whether or not a system is in a safe state: “Safe” or “Not Safe”

2) If the system is in “Safe” state, print the sequence of processes satisfies the safety requirement.

Ex) <P1, P3, P4, P0, P2>

Algorithm:

Let Work and Finish be vectors of length m and n, respectively. Initialize Work = Available and Finish[i]= false for i = 0, 1, ..., n − 1.

2. Find an index i such that both

a. Finish[i]== false

b. Needi ≤ Work

If no such i exists, go to step 4.

3. Work = Work + Allocationi

Finish[i]= true

Go to step 2.

4. If Finish[i]== true for all i,then the system is in a safe state.

This algorithm may require an order of m× n^2 operations to determine whether a state is safe.

Answer 1

***CODE IN C***:-

#include <stdio.h>
int
main ()
{
  
int n, m, i, j, k;
  
C CODE:-

#include <stdio.h>
int
main ()
{
  
int n, m, i, j, k;
  

n = 5;
  
printf ("Enter maximum number of each resources");
  

scanf ("%d", &m);
  


int alloc[5][m];
printf ("Enter allocation number of each resources :\n");
  

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

{
  

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

   {
  

printf ("Allocation - [%d],[%d] : ", i, j);
  

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

}
  

}

  


int max[5][3] = { {7, 5, 3},
{3, 2, 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;
      

}
  

}
  

}
  

}
  

printf("Safe and \n ") ;
printf ("Following is the SAFE Sequence\n");
  

for (i = 0; i < n - 1; i++)
  

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

printf (" P%d", ans[n - 1]);

}

***INPUT AND OUTPUT***:- SCREENSHOT

*** PLEASE GIVE A THUMBS UP IN RATINGS IF YOU LIKE THE ANSWER***