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
Q29: _ is necessary in any computer system
Q30: _ is the policy of allowing only
Q31: An algorithm designed to detect starvation by
Q32: Failure to lock database records before updating
Q33: Fill in the missing step in the
Q34: _ is when each process involved in
Q35: The scheme of _ removes the possibility
Q36: In the "dining philosophers" problem,a philosopher can
Q38: The first and simplest recovery method,and the
Q39: Assume that the events in the accompanying
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents