Numerical Solved by Banker’s Algorithm

Q2. Consider the table given below for a system, find the need matrix and the safety sequence, is the request from process P1(0, 1, 2) can be granted immediately.

Resource – 3 types

A – (10 instances)

B – (5 instances)

C – (7 instances)

Process

Allocation

Maximum

Available

Need

P0

P1

P2

P3

P4

A

B

C

0

1

0

2

0

0

3

0

2

2

1

1

0

0

2

A

B

C

7

5

3

3

2

2

9

0

2

2

2

2

4

3

3

A

B

C

3

3

2

A

B

C

7

4

3

1

2

2

6

0

0

0

1

1

4

3

1

Solution:

Answer is available in the link given below:

http://worldfullofquestions.com/numerical-solved-by-bankers-algorithm/

Advertisements

2 thoughts on “Numerical Solved by Banker’s Algorithm

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s