Question 11
Consider the Schedule given below:
| R(D) | ||
| R(A) | ||
| R(C) | ||
| W(A) | ||
| R(B) | ||
| R(C) | ||
| R(E) | ||
| R(A) | ||
| R(D) | ||
| W(A) | ||
| W(B) | ||
| R(E) |
Which of the following statements is/are correct about the given Schedule?
A precedence graph of the schedule is acyclic
The given schedule is not view serializable
The given schedule is view serializable but not conflict serializable
The given schedule is view serializable and conflict serializable