Scribd
Upload
11 views2 pages

Deadlock Avoidance - Practice Problems

The document presents assignment problems related to deadlock avoidance, specifically focusing on calculating the need matrix, determining if the system is in a safe state, and identifying the total resources for given processes. It includes examples using the Banker's algorithm and provides snapshots of system states for analysis. The problems require understanding of resource allocation, maximum demand, and available resources in a computing environment.

Uploaded by

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

Deadlock Avoidance - Practice Problems

The document presents assignment problems related to deadlock avoidance, specifically focusing on calculating the need matrix, determining if the system is in a safe state, and identifying the total resources for given processes. It includes examples using the Banker's algorithm and provides snapshots of system states for analysis. The problems require understanding of resource allocation, maximum demand, and available resources in a computing environment.

Uploaded by

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

Assignment Problems on Deadlock Avoidance

1. Consider the following snapshot of a system:


Allocation Max Available
Processes
A B C A B C A B C

P0 1 1 2 4 3 3 2 1 0

P1 2 1 2 3 2 2

P2 4 0 1 9 0 2

P3 0 2 0 7 5 3

P4 1 1 2 1 1 2

i. calculate the content of the need matrix?


ii. Is the system in a safe state? Determine the safe sequence
iii. Determine the total amount of resources of each type?

2. Bankers algorithm problems


Prob. Consider the following snapshot of a system-

Answer the following questions using the Banker’s algorithm-


(i) What is the content of the matrix need?
(ii) Is the system in a safe state? Determine the safe sequence
(iii) If a request from process P1 arrives for (0,4,2,0), can the request be granted
immediately?
3. Consider the following snapshot of a system:
Allocation Max Available
Processes
A B C A B C A B C

P0 1 1 2 4 3 3 2 1 0

P1 2 1 2 3 2 2

P2 4 0 1 9 0 2

P3 0 2 0 7 5 3

P4 1 1 2 1 1 2

i. calculate the content of the need matrix?


ii. Is the system in a safe state? Determine the safe sequence
iii. Determine the total amount of resources of each type?

4. Consider the following ,

i. calculate the content of the need matrix?


ii. Is the system in a safe state? Determine the safe sequence

You might also like