Given a priori information about the ________ 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.
A. minimum
B. average
C. maximum
D. approximate
Answer:A
Given a priori information about the ________ 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.
A. minimum B. average C. maximum D. approximate
Explanation: None.