In the Student Registration System, give an example of a schedule in which a deadlock occurs.
What will be an ideal response?
Consider the concurrent execution of a registration transaction, T1, and a deregistration transaction, T2, for the same course and assume the DBMS uses page locking:
T2 first deletes the rowin Transcript describing the student registered in that course and then decrements CurReg in Course. The registration transaction, T1, first updates Course, and then inserts a tuple in Transcript.
The schedule is:
w2(x) w1(y) w2(y) w1(x)
A deadlock might result since T1 and T2 obtain their locks in the opposite order.
You might also like to view...
Which of the following is found on the Fonts Effects tab?
A) Relief B) Small Capitals C) Underlining D) All of the above
How does the depth-first search (DFS) strategy of graph traversal differ from the breadth-first search (BFS) strategy?
What will be an ideal response?