Assess graduate students' understanding of key consistency models in distributed systems — strong (e.g., linearizability/serializability), eventual, and causal. Require concise definitions, formal guarantees (ordering, visibility, atomicity), and discussion of practical trade-offs including performance, availability under partitions, implementation complexity, and suitable use cases. Include short analytic questions comparing model behavior under network partitions and different workload patterns.