CSC 453 - Operating Systems

Dr. R. M. Siegfried

Assignment #6 - page 344/8.3

Due Monday, April 1, 2024

Exercise 8.3

Consider the following snapshop of a system:

	Allocation	Max	Available
	A B C D	A B C D	A B C D
P0	0 0 1 2	0 0 1 2	1 5 2 0
P1	1 0 0 0	1 7 5 0
P2	1 3 5 4	2 3 5 6
P3	0 6 3 2	0 6 5 2
P4	0 0 1 4	0 6 5 6

Answer the following questions using the Banker's algorithm:

1. What is the content of the matrix Need?
2. Is the system in a safe state?
3. If a request from process P₁ arrives for (0, 4, 2, 0), can the request be granted immediately?

[Back to the Assignments Index]