A couple of questions:

1. I'm going through the lecture notes again and I just want to confirm if this is correct:

The question is to determine whether the following schedules are serializable.

a. r1(x),w1(x),r2(y),r1(y),w2(y),w1(y),w2(x) => No. Conflict in r1(y) and w2(y) and w2(y) and w1(y).

b. r1(x),w1(x),r1(y),w1(y),r2(y),w2(y),w2(x) = Yes. No conflicts.

Thanks.

2. Also, just to refresh what was covered last Monday, how did we run through the schedule to check whether they're serializable?

Did we check r1(x) against w1(x),r2(y),r1(y),w2(y),w1(y), and w2(x).

Then w1(x) against r2(y),r1(y),w2(y),w1(y), and w2(x)

... and so forth (until the end) to check whether there's a conflict?

For number 1 part b, does r1(x) conflict with w2(x)?

Likewise, does w1(x) conflict with w2(x)?

I would go with yes, they're read-write & write-write conflicts (respectively).