Problem 1: Consider the following snapshot of a system:
|
|
Allocation
|
Max
|
|
|
ABCD
|
ABCD
|
|
P1
|
2001
|
4212
|
|
P2
|
3101
|
5282
|
|
P3
|
2113
|
2316
|
|
P4
|
1312
|
1424
|
|
P5
|
1132
|
3675
|
|
P6
|
0103
|
3453
|
Answer the following questions using the banker's algorithm:
a. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete. Give the Available matrix after completion of each process.
b. If a request from process P1 arrives for (1. 1, 0. 2). can the request be granted immediately? Explain your response.
c. If a request from process P3 arrives for (0.2. 0, 2). can the request be granted immediately? Explain your response.
Problem 2: Consider the system snapshot with the following single-instance resource allocation graph:
a. Draw the corresponding wait-for graph showing only the processes.
b. Is the system deadlocked? Explain your response.