If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are
(a) Non conflict equivalent
(b) Equal
(c) Conflict equivalent
(d) Isolation equivalent
This question was addressed to me during an interview.
This key question is from Serializability topic in division Transactions of RDBMS