Assess learners' ability to evaluate and choose between strong (e.g., linearizability, sequential) and eventual consistency models in distributed databases. Scope includes definitions, the CAP theorem, metrics (latency, availability, throughput), design patterns (replication, leader election, quorum, vector clocks, conflict resolution), and trade-offs. Students must analyze several application scenarios (e.g., banking, social feeds, real-time analytics), justify a consistency choice, propose an architecture, and explain mitigations for availability, performance, and correctness concerns.