Example 1: Which of these two actions are conflicting and which are not? a. r1(A), r2(A) b. r1(A), r2(B) c. r1(A), r1(B) d. r1(A), w2(B) e. r1(A), w2(A) f. w1(A), w2(A) ---------------------------------------------------------------------- Example 2: Show that this schedule is conflict-serializable using transformations: r1(A) w1(A) r2(A) w2(A) r1(B) w1(B) r2(B) w2(B) ---------------------------------------------------------------------- Example 3: Is this schedule conflict-serializable? Use transformations alone. r1(A) w1(A) r2(A) w2(A) r2(B) w2(B) r1(B) w1(B) ---------------------------------------------------------------------- Example 4: Construct precedence graphs for schedules in Example 2 and 3. (a) r1(A) w1(A) r2(A) w2(A) r1(B) w1(B) r2(B) w2(B) (b) r1(A) w1(A) r2(A) w2(A) r2(B) w2(B) r1(B) w1(B) ---------------------------------------------------------------------- Example 5: Consider the schedule r2(B) w2(A) r1(A) r3(A) w1(B) w2(B) w3(B) (a) Is this conflict-serializable? (b) Is this serializable? ----------------------------------------------------------------------