A. Resource allocation state
B. System storage state
C. Operating system
D. Resources

A. Resources currently available
B. Processes that have previously been in the system
C. Resources currently allocated to each process
D. Future requests and releases of each process

A. Minimum
B. Average
C. Maximum
D. Approximate

A. The system does not crash due to deadlock occurrence
B. The system can allocate resources to each process in some order and still avoid a deadlock
C. The state keeps the system protected and safe
D. All of the mentioned

A. Safe allocation
B. Safe resource
C. Safe sequence
D. All of the mentioned

A. Deadlocks
B. Not deadlocks
C. Fatal
D. None of the mentioned

A. P0, p1, p2
B. P1, p2, p0
C. P2, p0, p1
D. P1, p0, p2

A. Then the system will not be in a safe state
B. Then the system will be in a safe state
C. All of the mentioned
D. None of the mentioned

A. With multiple instances of each resource type
B. With a single instance of each resource type
C. Single & multiple instances of each resource type
D. None of the mentioned

A. Less efficient
B. More efficient
C. Equal
D. None of the mentioned