You can make a Precedence graph for the two schedules.And check for the conflicts pairs making a Cycle.
S1 makes a cycle. T1-->T2 and T2-->T1. And hence is not Conflict Serializable.
S2 does not makes cycle and has transition from T2-->T1 only. And hence is Conflict Serializable.
Conflict Pairs: RW, WR, WW.