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?

Explanation:

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.

you have to be a moderator in order to delete questions. ask jaysl the community associate any questions about the application if you don't understand anything. happy to   : )   here's the application link if you want to apply http:

solution:

this situation is called an ip conflict.

data from a server is sent in small bits called packets. in an ip conflict, some packets will end up in one computer while some other packets will end up in another computer.

so…overall none of the computers get the data as the original message or picture being sent by the server cannot be retrieved with only half the packets. so it will show up as an error.

thus the final answer is d.