Operating Systems Fundamentals $($CS$2342)-$ Assignment $1$

Consider the following snapshot of a system:

Using the banker's algorithm:

Available $=(0,3,0,1)$

Available $=(1,0,0,2)$

Determine whether or not each of the following states is unsafe. If the state is safe, show the

order in which the processes may completed. Otherwise, explain why the state is unsafe.

If a request from process $P1$ arrives for $(1,1,0,0),$ can the request be granted

immediately?

If a request from process $P4$ arrives for $(0,0,2,0),$ can the request be granted

immediately?