Hello everyone,

I'm going through Locking videos to make sure the concept really sinks in.

But I realized I solved 4a) before I started getting into locking. So the example I've came up with for a serializable schedule that is non-serial does not involve any locks.

I've proved it by interleaving certain transactions in a way that doesn't cause conflicts and/or the precedence graph is acyclic. I was wondering if that would be acceptable or

an example involving locks would be a better solution.

Thank you very much.

Alright, thank you Professor.