Which of the following is the first step in reducing a directed graph to eliminate deadlock?
A. Remove the process that is holding on to the most resources.
B. Find a process that's waiting only for resource classes that aren't fully allocated
C. Find a process that is currently using a resource and not waiting for one.
D. Find the oldest process and remove it from the graph.
Answer: C
Computer Science & Information Technology
You might also like to view...
What is the term used for the range of values that can be used to control the symmetric encryption function while converting plaintext into ciphertext?
A. Block size B. Key space C. Key length D. Rounds
Computer Science & Information Technology
_________ representation is when the radix point is fixed and assumed to be to the right of the rightmost digit.
Fill in the blank(s) with the appropriate word(s).
Computer Science & Information Technology