FlashcardsRecall, then flip

Print · ACID

Back to study

12 cards · 2 sheets · 4 pages.

Print double-sided, flipping on the long edge, at 100% scale with no margins added by the browser. Answer columns are already mirrored, so each answer lands on the back of its own question. Cut along the dashed lines. The last sheet has 4 blank cells, since this deck is not a multiple of eight.

Preview

ACID flashcards — questions (cards 1-8)Print double-sided, flip on long edge, cut along dashed lines
CARD 1 · QUESTION

What does ACID stand for?

CARD 2 · QUESTION

Define atomicity.

CARD 3 · QUESTION

Define consistency (in ACID terms).

CARD 4 · QUESTION

Define isolation.

CARD 5 · QUESTION

Define durability.

CARD 6 · QUESTION

Name the four standard isolation levels, weakest to strongest.

CARD 7 · QUESTION

What is a dirty read?

CARD 8 · QUESTION

Non-repeatable read vs phantom read?

ACID flashcards — answers (cards 1-8)Columns mirrored so answers align with question backs
CARD 2 · ANSWER

All or nothing: a transaction either fully completes or fully rolls back. No partial effects are ever visible. It's about failure handling, not concurrency.

CARD 1 · ANSWER

Atomicity, Consistency, Isolation, Durability — the four guarantees a database makes about transactions.

CARD 4 · ANSWER

Concurrent transactions don't interfere with each other. The result is as if they had run one at a time (serially).

CARD 3 · ANSWER

Every transaction moves the database from one valid state to another — constraints and invariants (foreign keys, uniqueness, business rules) always hold.

CARD 6 · ANSWER

Read uncommitted, read committed, repeatable read, serializable. Postgres defaults to read committed; MySQL InnoDB to repeatable read.

CARD 5 · ANSWER

Once committed, data survives crashes and power loss — via write-ahead logging, fsync to disk, and (in distributed databases) replication.

CARD 8 · ANSWER

Non-repeatable: a row you already read changes between two reads. Phantom: new rows matching your query appear between two reads.

CARD 7 · ANSWER

Reading another transaction's uncommitted changes, which may later roll back. Prevented by read committed and above.

ACID flashcards — questions (cards 9-12)Print double-sided, flip on long edge, cut along dashed lines
CARD 9 · QUESTION

How do databases implement atomicity and durability?

CARD 10 · QUESTION

What is MVCC?

CARD 11 · QUESTION

What is BASE and how does it contrast with ACID?

CARD 12 · QUESTION

Which ACID property is the 'odd one out' and why?

ACID flashcards — answers (cards 9-12)Columns mirrored so answers align with question backs
CARD 10 · ANSWER

Multi-version concurrency control: writers create new row versions instead of overwriting; each transaction reads a consistent snapshot. Readers never block writers.

CARD 9 · ANSWER

The write-ahead log (WAL): changes are appended to a sequential log and fsynced before commit. Crash recovery replays the log — redo committed, undo uncommitted.

CARD 12 · ANSWER

Consistency. A, I, and D are pure database mechanisms; C is a joint responsibility — the application defines what 'valid' means, the database only enforces declared constraints.

CARD 11 · ANSWER

Basically Available, Soft state, Eventually consistent — the availability-first model of AP systems, trading strict guarantees for uptime and scale.