2 votes 2 votes True / false? 1. Serial schedules don't have any conflicting pairs. 2. Serializable schedules don't have any conflicting pairs Databases databases transaction-and-concurrency + – rahul sharma 5 asked Jul 15, 2017 retagged Aug 5, 2017 by Arjun rahul sharma 5 464 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shubhanshu commented Jul 20, 2017 reply Follow Share I think both are false because in the serializable schedule we can draw the precedence graph based on those conflicting pairs only. And the same reason for serial schedule also. correct me if I am wrong. 2 votes 2 votes joshi_nitish commented Nov 3, 2017 reply Follow Share 1- true 2- False. consider this example, how could here be any type of conflict, beacuse transaction T1 have been finished even before T2 has started.. in serial schedules transactions does not runs concurrently, so ho can be there conflict b/w them ?? 0 votes 0 votes Shubhanshu commented Nov 3, 2017 reply Follow Share @joshi_nitish good observation but check this out http://inst.eecs.berkeley.edu/~cs186/fa06/lecs/19cc1.pdf Definition of conflict, Two operations said to be conflict if --They are by different transactions, – they are on the same object, – and at least one of them is a write 0 votes 0 votes Please log in or register to add a comment.