Match the LIST-I with LIST-II

LIST-I	LIST-II
A. Wait-for graph	I. Holds all locks until it commits
B. Precedence graph	II. Holds write-locks until it commits
C. Rigorous 2PL	III. Use to check deadlocks
D. Strict 2PL	IV. Used to check serializability

Choose the correct answer from the options given below:

Explanation

A wait-for graph is a runtime structure that tracks which transaction is waiting for locks held by another, and is used to detect deadlocks (A-III). A precedence (serialization) graph records the order of conflicting operations between transactions and is used to check whether a schedule is conflict-serializable (B-IV). Rigorous 2PL holds all locks, both shared and exclusive, until the transaction commits (C-I), whereas Strict 2PL only holds write (exclusive) locks until commit while read locks may be released earlier (D-II). This gives A-III, B-IV, C-I, D-II.