Question

Your program must be named "banker" and will read the allocation, max, available, and request vectors from a file. The name of the file will be passed to your program as a command line argument. The input file format is the following:

• number of processes: n
• number of resource types: m
• An n x m allocation matrix
• An n x m max matrix
• A 1 x m available vector
• A i : 1 x m request vector

Your program will output the following in a standardized format.

1. Echo the number of processes.
2. Echo the number of resource types.
3. Echo the allocation matrix. Label the processes and resource types (see sample output).
4. Echo the max matrix. Label the processes and resource types (see sample output).
5. Compute and print the need matrix. Label the processes and resource types (see sample output).
6. Echo the available vector. Label the resource types.
7. Compute if the system is in a safe state.
8. Echo the request vector. Label the process making the request and resource types (see sample output).
9. Compute if the request can be granted.
10. Compute the new available vector (see sample output).

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Sample Input

5

4

0 0 1 2
1 0 0 0
1 3 5 4
0 6 3 2
0 0 1 4

0 0 1 2
1 7 5 0
2 3 5 6
0 6 5 2
0 6 5 6

1 5 2 0

1:0 4 2 0

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Sample Output

There are 5 processes in the system.

There are 4 resource types.

The Allocation Matrix is...
   A B C D
0: 0 0 1 2
1: 1 0 0 0
2: 1 3 5 4
3: 0 6 3 2
4: 0 0 1 4

The Max Matrix is...
   A B C D
0: 0 0 1 2
1: 1 7 5 0
2: 2 3 5 6
3: 0 6 5 2
4: 0 6 5 6

The Need Matrix is...
   A B C D
0: 0 0 0 0
1: 0 7 5 0
2: 1 0 0 2
3: 0 0 2 0
4: 0 6 4 2

The Available Vector is...
A B C D
1 5 2 0

THE SYSTEM IS IN A SAFE STATE!

The Request Vector is...
  A B C D
1:0 4 2 0

THE REQUEST CAN BE GRANTED!

The Available Vector is...
A B C D
1 1 0 0

Answer 1

I am going to write this program in Python.

Following is the code for the same:

import sys

def print_output(file_name):

        f = open(file_name, 'r')

        lines = [line for line in f.readlines() if line.strip()]

        i = 0

        np = int(lines[i].strip())

       print "There are " + str(np) + " processes in the system.\n"

       i = i+1

      nr = int(lines[i].strip())

      print "There are " + str(nr) + " resource types.\n"

       i = i+1

      al_mat = [[0 for x in range(nr)] for y in range(np)]

      print "The Allocation Matrix is..."

      print " ",

      for char in range(65, 65+nr):

         print " " + chr(char),

     print ""

     for j in range(0, np):

        print str(j) + ":",

        for k in range(0, 2*nr-1, 2):

            al_mat[j][k/2] = int(lines[j+i][k])

            print " " + lines[j+2][k],

       print ""

    i = i+np

    max_mat = [[0 for x in range(nr)] for y in range(np)]

    print "\nThe Max Matrix is..."

    print " ",

    for char in range(65, 65+nr):

        print " " + chr(char),

   print ""

for j in range(0, np):

print str(j) + ":",

for k in range(0, 2*nr-1, 2):

max_mat[j][k/2] = int(lines[j+i][k])

print " " + lines[j+i][k],

print ""

need_mat = [[0 for x in range(nr)] for y in range(np)]

print "\nThe Need Matrix is..."

print " ",

for char in range(65, 65+nr):

print " " + chr(char),

print ""

for j in range(0, np):

print str(j) + ":",

for k in range(0, nr):

need_mat[j][k] = max_mat[j][k] - al_mat[j][k]

print " " + str(need_mat[j][k]),

print ""

i = i+np

avail_vec = [0 for x in range(nr)]

safe = 0

print "\nThe Available Vector is..."

for char in range(65, 65+nr):

print chr(char) + " ",

print ""

for k in range(0, 2*nr-1, 2):

avail_vec[k/2] = int(lines[i][k])

print lines[i][k] + " ",

if (avail_vec[k/2] != 0):

safe = 1

if (safe):

print "\n\nTHE SYSTEM IS IN A SAFE STATE!"

else:

print "\n\nTHE SYSTEM IS NOT IN A SAFE STATE!"

i = i+1

req_vec = [0 for x in range(nr)]

grant = 1

print "\nThe Request Vector is..."

print " ",

for char in range(65, 65+nr):

print " " + chr(char),

print ""

print lines[i][:2],

for k in range(2, 2*nr+1, 2):

req_vec[k/2-1] = int(lines[i][k])

print lines[i][k] + " ",

avail_vec[k/2-1] = avail_vec[k/2-1] - req_vec[k/2-1]

if (avail_vec[k/2-1] < 0):

grant = 0

if (grant):

print "\n\nTHE REQUEST CAN BE GRANTED!"

else:

print "\n\nTHE REQUEST CAN NOT BE GRANTED!"

print "\nThe Available Vector is..."

for char in range(65, 65+nr):

print chr(char) + " ",

print ""

for k in range(0, nr):

print str(avail_vec[k]) + " ",

def main():

if len(sys.argv) < 2:

print('Please provide the input file path name while running the program.')

sys.exit(1)

file_name = sys.argv[1]

print_output(file_name)

if __name__ == '__main__':

main()

max mat [I0 for x in range (nr)] for y in range (np)l print "nThe Max Matrix is." print ", for char in range (65, 65+nr): print "chr(char), print" for j in range (0, np): print str(j) ", for k in range(0, 2*nr-1, 2): max_matljJ[k/2]int(lines Ij+i][k]) print ""+ lines [j+i][k], print "" need, mat = [[0 for x in range (nr)] for y in range(np)] print "nThe Need Matrix is...'" print " for char in range (65, 65+nr): print "" chr(char), print "n for j in range (0, np): print str(j) + :, for k in range(0, nr): need matjl[k] max_matj[k] al mat[j1[k] print "+str(need mat [j][k]), print"

avail_vec [0 for x in range(nr)] safe print "nThe Available Vector is..." for char in range (65, 65+nr): print chr(char) + ", print " for k in range(0, 2*nr-1, 2): avail vec[k/2]int(lines [i][k]) print lines[i][k] + " if (avail vec [k/2] !=0); - safe = 1 if (safe): print "n nTHE SYSTEM IS IN A SAFE STATE!" print "In\nTHE SYSTEM IS NOT IN A SAFE STATE!" i+1 else: req vec [0 for x in range (nr)] grant 1 print "InThe Request Vector is..." print " ", for char in range (65, 65+nr): print " chr(char), print n print lines [i][ 21, for k in range (2, 2*nr+1, 2): req_vec[k/2-1] int(lines [i][k]) print lines[i] [k] avail_vec[k/2-1] avail_vec[k/2-1] if (availvec [k/2-1] < θ): req_vec[k/2-1] - grant = θ