Question$/$Description

$[10$ Marks$]$

Banker's Algorithm is designed to prevent deadlocks by ensuring that a system never enters an unsafe state during resource allocation. Develop a Python program that simulates the Banker's Algorithm for resource allocation. The program should be capable of performing the following:

Input Specification:

Number of processes and number of resource types.

Available instances of each resource type.

Maximum demand of each resource for each process.

Allocation matrix $($resources currently allocated to each process$).$

Need matrix $($resources still required by each process$).$

Simulation of Resource Requests:

The program should accept resource requests from any process and check whether the system will remain in a safe state after the request.

If the system is in a safe state, allocate the requested resources. Otherwise, deny the request and indicate that granting the resources would lead to an unsafe state.

Safety Check:

Implement the safety algorithm to check if the system can remain in a safe state after each request.

Output:

Print the current state of the system $($available resources, allocation matrix, and need matrix$)$ after each resource request.

Indicate whether the system is in a safe or unsafe state.

Correctness and Completeness of Implementation $[6$ Marks$]$:

Your code correctly implements the Banker's Algorithm, processes resource requests, and performs safety checks.

Code Structure and Documentation $[2$ Marks$]$:

Your code is well$-$organized, modular, and properly documented.

Report Quality $[2$ Marks$]$:

The report clearly explains the algorithm, your approach, and how the simulation works.Question$/$Description

$[10$ Marks$]$

Banker's Algorithm is designed to prevent deadlocks by ensuring that a system never enters an unsafe state during resource allocation. Develop a Python program that simulates the Banker's Algorithm for resource allocation. The program should be capable of performing the following:

Input Specification:

Number of processes and number of resource types.

Available instances of each resource type.

Maximum demand of each resource for each process.

Allocation matrix $($resources currently allocated to each process$).$

Need matrix $($resources still required by each process$).$

Simulation of Resource Requests:

The program should accept resource requests from any process and check whether the system will remain in a safe state after the request.

If the system is in a safe state, allocate the requested resources. Otherwise, deny the request and indicate that granting the resources would lead to an unsafe state.

Safety Check:

Implement the safety algorithm to check if the system can remain in a safe state after each request.

Output:

Print the current state of the system $($available resources, allocation matrix, and need matrix$)$ after each resource request.

Indicate whether the system is in a safe or unsafe state.