Question 47

Computer Awareness Introduction to Operating Systems Easy

We can say that a schedule is conflict serializable?

(A) If a schedule \( T \) can be transformed into a serial schedule \( U \) by a series of swaps of conflicting operations.
(B) If a schedule \( T \) can be transformed into a serial schedule \( U \) by a series of swaps of nonconflicting operations.
(C) If a schedule \( T \) can be transformed into a nonserial schedule \( U \) by a series of swaps of conflicting operations.
(D) If a schedule T can be transformed into a nonserial schedule U by a series of swaps of nonconflicting operations.
View Dynamic Solution & Explanation
Correct Solution: Option B

Step-by-step Solution:

No explanation entered yet.