System Design Interview Patterns-II

Checksum

Definition:

Context:

Solution:

Example:

CAP Theorem

Definition:

  1. Availability (A): Availability means that every request received by an alive node results in a response. Even if there are severe network failures, every request must complete successfully. In other words, system remains accessible even if one of the nodes go down.
  2. Consistency ( C): Consistency means that users can read or write to any node in the system i.e. all the users receive the same data from every node. This is equivalent to having one single upto-date copy of the data.
  3. Partition tolerance (P): A partition is a network failure between two nodes in the system i.e. nodes are up but unable to communicate. A partition tolerant system continues to operate even if there are partitions in the system. This is only applicable when network failures do not result in entire system failure. The data is replicated across multiple nodes and the system is up & working even through temporary failures.

Context:

Solution:

Example:

PACELC Theorem

Definition:

  1. in case of network partition, the system trades off between availability and consistency
  2. otherwise, the system has to tradeoff between latency and consistency

Context:

Solution:

Example:

Hinted Handoff

Definition:

Context:

Solution:

Example:

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
SAKSHI CHHABRA

SAKSHI CHHABRA

Master's student in Computer Science from University of Florida. I love to write and help others, so here am i.