1
Q
what is a deadlock
A
when a process in a state “s” if the process is blocked in “s” and if no matter what state transition occur in the future, the process will remain blocked
2
Q
what is the maximum claim of a process?
A
the set of all resources the process may ever request
3
Q
what is a resource claim graph?
A
an extension of resource allocation graph but also including the potential future resources
