

MCQOPTIONS
Saved Bookmarks
1. |
A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist. |
A. | resource allocation state |
B. | system storage state |
C. | operating system |
D. | resources |
Answer» B. system storage state | |