The Banker’s Algorithm is a critical deadlock avoidance method used in operating systems. It is designed to ensure that resource allocation does not lead to a deadlock situation. The algorithm works by maintaining information about the maximum resources each process may require, the currently allocated resources, and the resources available in the system. Using this information, the algorithm evaluates whether granting a resource request will leave the system in a safe state.

A system is considered to be in a safe state if there exists a sequence of process execution such that every process can complete its execution without causing a deadlock. Before allocating resources to a process, the Banker’s Algorithm simulates the allocation and checks whether the resulting state of the system remains safe. If the system remains safe, the request is granted; otherwise, the process must wait.

Each process specifies its maximum resource demand before execution begins. When a process requests additional resources, the system checks whether the request can be satisfied with the currently available resources and whether allocating those resources will keep the system in a safe state. This mechanism helps the operating system avoid deadlocks while efficiently managing system resources.

Which data structure does the Banker’s Algorithm use to maintain the state of available, maximum and allocated resources?