Computer Science Homework Help

Given the following state for the Banker’s Algorithm (section 6.3) 6 processes P0 through P5 4 resource types: A (15 instances); B (6 instances) C (9 instances); D (10 instances)

Snapshot at time T0:

Available

A B C D

Current allocation Maximum demand

a. Verify that the Available array has been calculated correctly.

b. Calculate the Need matrix.

c. Show that the current state is safe, that is, show a safe sequence of processes. In addition, in the sequence, show how the Available (working array) changes as each process terminates.

d. Given the request (3,2,3,3) from Process P5. Should this request be granted? Why or why not?