A schedule S of n transactions is serializable if it is equivalent to some
PYQ RPSC Programmer 2011
A schedule S of n transactions is serializable if it is equivalent to some
- A.
Serial schedule of same n transactions
- B.
Non Serial schedule of same n transactions
- C.
Serial schedule of different n transactions
- D.
Non Serial schedule of different n transactions
Attempted by 1 students.
Sign up free to check your answer
Sign up freeLoading lesson…