Q. A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist. (Solved)
1. resource allocation state
2. system storage state
3. operating system
4. resources
- a. resource allocation state
1. resource allocation state
2. system storage state
3. operating system
4. resources