Question

Two processes, a and b, each need three records, a, b, and c, in a database. If a asks for them in the order a, b, c, and b asks for them in the same order, deadlock is not possible. However, if b asks for them in the order c, b, a, then deadlock is possible. What fraction of all the combinations is guaranteed to be deadlock free? 1. 1/3 2. 2/3 3. 1/6 4. 5/6

Answer 1

Answer:

hi

buddy here is your answer to your question

Explanation:

the answer 1/3