Concurrency
Question 1 |
Considering the following statements:
A. A non-serial schedule is said to be conflict serializable, if it is conflict-equivalent to some serial schedule.
B. A non-serial schedule is said to be view serializable if it is view-equivalent to some serial schedule.
C. A schedule is said to be serial, if instructions of participating transactions are chronologically interleaved with each other.
D. A conflict-serializable schedule will be view-serializable also but vice-versa may not be true.
Choose the correct answer from the options given below:
A. A non-serial schedule is said to be conflict serializable, if it is conflict-equivalent to some serial schedule.
B. A non-serial schedule is said to be view serializable if it is view-equivalent to some serial schedule.
C. A schedule is said to be serial, if instructions of participating transactions are chronologically interleaved with each other.
D. A conflict-serializable schedule will be view-serializable also but vice-versa may not be true.
Choose the correct answer from the options given below:
A, B, C, D | |
A, B, C Only | |
A, B, D Only
| |
B, C, D Only |
There is 1 question to complete.
