0
10kviews
using bankers algorithm, answer the following questions:- i)How many resources of type A,B,C,D are there? ii)What are the content
PROCESS Max Allocation Available
--- A B A B A B
--- C D C D C D
P0 6 0 4 0 3 2
--- 1 2 0 1 1 1
P1 1 7 1 1
--- 5 0 0 0
P2 2 3 1 2
--- 5 6 5 4
P3 1 6 0 6
--- 5 3 3 3
P4 1 6 0 2
--- 5 6 1 2

Subject: Operating System

Topic: PROCESS COORDINATION

Difficulty: Hard

1 Answer
0
720views

Solution:

  1. A-9; B-13; C-10; D-11

    1. Need[ i,j ] = Matrix[ i,j ] - Allocation[ i,j ] so content of need matrix is
A B C D
P0 2 0 1 1
P1 0 6 5 0
P2 1 1 0 2
P3 1 0 2 0
P4 1 4 4 4
  1. The system is in a safe state as the processes can be finished in the sequence P0, P2, P4, P1& P3
Please log in to add an answer.