In a schedule, if update performed by transaction T1 on data item ‘X’ gets overwritten by the update performed by transaction T2 on same data

Learn Data Science, Machine Learning and Artificial Intelligence
In a schedule, if update performed by transaction T1 on data item ‘X’ gets overwritten by the update performed by transaction T2 on same data
A schedule is the representation of execution sequence for all the instructions of the transactions. Schedules are categorized in two types: Serial Schedules Concurrent Schedules
Precedence graph algorithm can be used to find out whether the given concurrent schedule is conflict serializable or not. Algorithm: Create the number of node