Consider the precedence graph of the following figure. Is the corresponding schedule conflict serializable? Explain your answer.

Consider the precedence graph of the following figure. Is the corresponding schedule conflict serializable? Explain your answer.

Ans: There is a serializable schedule corresponding to the precedence graph below, since the graph is acyclic. A possible schedule is obtained by doing a topological sort, that is, T1, T2, T3, T4, T5. 

Note: Same as for the following figure: