Multiple Choice
Fill in the missing event that causes deadlock in a database.There are two processes (P1 and P2) ,each of which needs to update two records (R1 and R2) and the following sequence leads to a deadlock:
1) P1 accesses R1 and locks it.
2) P2 accesses R2 and locks it.
3) ____
4) P2 requests R1,which is locked by P1.
A) P2 releases R2.
B) P1 requests R1 again.
C) P1 requests R2,which is locked by P2.
D) P2 releases R1.
Correct Answer:

Verified
Correct Answer:
Verified
Q13: A deadlock is preceded by the simultaneous
Q14: The first and simplest recovery method,and the
Q15: Assume that the events in the accompanying
Q16: Consider the case of a home construction
Q17: Deadlock does not usually affect the entire
Q19: All recovery algorithms have one feature in
Q20: Fill in the missing event that causes
Q21: _ is when each process involved in
Q22: Once starvation has been detected,an algorithm can
Q23: When using the Banker's Algorithm,an operating system