Advertisement

cs604 assignment 3 solution 2021

SOLUTION FILE LINK IS AVAILABLE AT THE END OF THE END OF PAGE.

ASLAM U ALAIKUM DEAR STUDENTS PLEASE ALLOW THE NOTIFICATIONS TO GET THE LATEST ASSIGNMENTS, GDBS AND QUIZZES SOLUTIONS FREE OF COST. IMPORTANT POINT IS THAT I WILL PROVIDE SOLUTION ON TIME THANKS.

Advertisement

Let us suppose a system with 5 processes P0 to P4 and four resource types R0 to R3. R0 has 9 instances, R1 has 3 instances, R2 has 2 instances, R3 has 2 instances. Let us consider that at time T= 0, the system has the following state

Advertisement
.

Processes Allocation Max Available
Resource Types R0 R1 R2 R3 R0 R1 R2 R3 R0 R1 R2 R3
P0 3 1 1 0 5 2 1 0 2 1 0 0
P1 2 0 0 0 2 1 0 1
P2 0 0 1 1 0 1 2 1
P3 2 1 0 0 3 2 1 1
P4 0 0 0 1 2 0 0 2

Advertisement

 

 

 

a) Calculate the Need Matrix for each process (P0 to P4) from the information given in the table.
b) Use the safety algorithm to find out that either the system is in a safe state or not. Write down the complete available Matrix (work matrix).
c) If the system is in a safe state then write down the safe sequence and if the system is not in a safe state then give a reason to support your answer

Advertisement

 

 

 

 

 

 

 

 

cs604 assignment 3 solution 2021

cs604 assignment 3 solution

Leave a comment