High CAP Question 141 of 226

Explain CAP theorem with PostgreSQL versus a multi-region DynamoDB-style store.

Java Specialist · Speak this in 60–90 seconds · Faridabad & Delhi NCR

PICTURE THIS: DATABASE INDEX

Without indexScan every row

With indexJump to keys

CostWrites slower

Simple meaning

On a network partition you cannot have both linearizable consistency and availability.

WHY — CAP instead of guessing?

Why interviewers care about CAP:

They want a clean

contrast on CAP, not two memorised paragraphs.

Say what changes for

the developer, then one case where picking wrong hurts.

Stay structured

Name the idea, why it exists, then one short example.

Close cleanly

End with when you use it and one common pitfall.

STEPS — What happens step by step?

Before you speak the answer, walk the interviewer through these steps:

1
On a network partition
you cannot have both linearizable consistency and availability.
2
A single-primary Postgres cluster
typically chooses consistency: the replica may refuse writes if it cannot reach the primary.
3
A multi-region AP store
keeps accepting writes and reconciles later.
4
Interviewers want you to
name the partition as the forcing function, not a vague CA system in the real world.
5
Common mistake
What juniors usually get wrong.
6
Close
When you pick this over the alternative.

EXAMPLE — See it in action

Here's a short line you can speak, broken into clear beats:

Say this line

“A multi-region AP store keeps accepting writes and reconciles later.”

Break into beats

AmultiregionAPstorekeeps

Speaking order

2987408337471632900

Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.

Key takeaway

On a network partition you cannot have both linearizable consistency and availability. A single-primary Postgres cluster typically chooses consistency: the replica may refuse writes if it cannot reach the primary.