Consider the following statements:
Statement I: A 2PL guaranteed schedule is surely be conflict serializable schedule.
Statements II: Wound wait and wait die algorithms are deadlock prevention algorithms and can cause more transaction aborts.
The number of the above statements is/are correct

Only II

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Both I and II

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

None of the above

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Only I

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B Both I and II
Both I and II is true
$∙$ Statement I is correct but reverse is not true.
$∙$ Statement II is correct explanation about wound wait and wait die systems.

Suggest Corrections

Similar questions

S_{1} : W_{2} (x), W_{1} (x), R_{3} (x), W_{2} (y), R_{3} (y), R_{3} (z), R_{2} (x), R_{1} (y)

S_{2} : R_{3} (z), W_{2} (x), W_{2} (y), R_{1} (x), R_{3} (x), R_{2} (z), R_{3} (y), W_{1} (x)

S_{1} : Dirty read problem is same as write-read conflict.

S_{2} : Unrepeatable reads is also known as read-write conflict

S_{3} : Strict two phase locking may have read-write conflict.

Join BYJU'S Learning Program