Scribd
Upload
21 views5 pages

Sample 604 2

Asssignment solution 2 cs604 2024

Uploaded by

zi4737797
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views5 pages

Sample 604 2

Asssignment solution 2 cs604 2024

Uploaded by

zi4737797
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Operating Systems (CS604) Total marks = 20

Deadline
Assignment # 02
June 24, 2024
Spring 2024
Solution File

MC210201430

Part 1:

1. Calculate the initial available resources.

Total Resources:

A: 7

B: 2

C: 3

Allocation Matrix:

( )
A BC
010
201
302

To calculate the available resources, we first sum up the resources


allocated to all processes:

Allocated Resources:

A: 0+2+3 = 5

B: 1+0+0 = 1

C: 0+1+2 = 3
Then subtract these from the total resources:

Initial Available Resources:

A: 7 – 5 = 2

B: 2 – 1 = 1

C: 3 – 3 = 0

2. Calculate the Need matrix:


Maximum Demand (Max) Matrix:

( )
A BC
612
312
502

Allocation Matrix:

( )
A BC
010
201
302

Need Matrix (Max-allocation):

( )
A BC
6 −0 1 −1 2− 0
3 −2 1 −0 2 −1
5 −3 0 −0 2 −2

( )
A BC
602
1 11
200
Part 2:
1. Determine if the current system state is safe.

Initial Available Resources:

[ 21 0 ]

Need Matrix:

( )
A BC
602
1 11
200

Allocation Matrix:

( )
A BC
010
201
302

Step By Step Checking Process:

Check P0:

Need: [ 6 , 0 , 2 ]
Available: [ 2 ,1 , 0 ]

Since, Need0 <= Available is false, P0 cannot proceed.

Check P1:

Need: [ 1 ,1 , 1 ]
Available: [ 2 ,1 , 0 ]

Since, Need1 <= Available is false, P1 cannot proceed.


Check P2:

Need: [ 2 , 0 ,0 ]
Available: [ 2 ,1 , 0 ]

Since, Need2 <= Available is true, P2 can proceed.

After P2 finishes, it releases its resources:[ 3 , 0 ,2 ]

New available resources are:[ 2+3 , 1+ 0 , 0+2 ] =[ 5 ,1 , 2 ]

Check P0 again:

Need: [ 6 , 0 , 2 ]
Available: [ 5 ,1 , 2 ]

Since, Need0 <= Available is false, P0 cannot proceed.

Check P1 again:

Need: [ 1 ,1 , 1 ]
Available: [ 5 ,1 , 2 ]

Since, Need1 <= Available is true, P1 can proceed.

After P1 finishes, it releases its resources:[ 2 , 0 ,1 ]

New available resources are:[ 5+2 ,1+ 0 ,2+1 ] =[ 7 , 1, 3 ]

Check P0 again:

Need: [ 6 , 0 , 2 ]
Available: [ 7 , 1, 3 ]

Since, Need0 <= Available is true, P0 can proceed.

After P0 finishes, it releases its resources:[ 0 , 1, 0 ]


New available resources are:[ 7+0 , 1+1 ,3+ 0 ] =[ 7 , 2 ,3 ]

Since all processes can finish , the system is in safe state . The safe sequence
is :

{P2, P1, P0}.

--------------------------------------------THE END ----------------------------------------

You might also like