Ask Question
15 March, 06:39

4) Two processes, A and B, each need three records, 1, 2, and 3 in a database. If A asks for them in the order 1,2,3, and B asks for them in the same order, deadlock is not possible. With three resources, there are 3! (factoral 3*2*1) or six possible combinations in which each process can request them. What fraction of all the combinations is guaranteed to be deadlock free?

+4
Answers (1)
  1. 15 March, 07:02
    0
    If A request for 1 and B also request for 1, then A succeed and B is going to block. This will avoid the deadlock.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “4) Two processes, A and B, each need three records, 1, 2, and 3 in a database. If A asks for them in the order 1,2,3, and B asks for them ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers