Final answer:
Given a priori information about the maximum number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
Step-by-step explanation:
Given a priori information about the maximum number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state. In a computer system, deadlock is a state where multiple processes are unable to proceed because each is waiting for a resource held by another process. To prevent deadlock, a resource allocation algorithm can be used, such as the Banker's Algorithm. The Banker's Algorithm considers the maximum number of resources each process may request and determines whether granting the request would result in a safe state. By carefully managing the allocation and release of resources, the system can avoid deadlock.