Chapter 2 checkpoint

Availability, consistency and estimation

Every question from this chapter’s lessons, grouped by the lesson that teaches it. Answer each one right to finish; you can try again whenever you like.

0 of 16 answered right

2.1 Consistency patterns

0 of 4 answered right
Open the lesson
Question 1
Which consistency pattern guarantees that, once a write completes, every later read sees it?

Question 2
Match each consistency pattern to the kind of system the lesson says uses it.

Question 3
A user updates their profile, which is written to the primary database. The page then reloads from a read replica that copies the primary asynchronously, and shows the old profile. What is happening?

Question 4
A Dynamo-style store keeps N=5N = 5 copies of each item and waits for W=3W = 3 acknowledgments on every write. What is the smallest read quorum RR that makes every read overlap every write?
replicas

Answers within 1% count.

2.2 Availability patterns and failover

0 of 4 answered right
Open the lesson
Question 5
A database runs as two servers in an active-passive pair. Why can it handle only as much traffic as one server?

Question 6
An active-active web tier must carry a peak of 9,000 requests per second, and each server handles 2,000. How many servers does it need so that losing any one still covers the peak?
servers

Answers within 1% count.

Question 7
The active server of an active-passive pair crashes, and the passive one takes over within seconds. Afterward, a few orders placed just before the crash are missing. What is the most likely cause?

Question 8
What does multi-leader replication offer that single-leader replication does not, and what does it cost?

2.3 Availability in numbers

0 of 4 answered right
Open the lesson
Question 9
A request passes through three tiers in series: DNS at 99.99%, a load balancer at 99.9% and an application server at 99.9%. What is the availability of the whole path, as a percentage?
%

Answers within 0.05% count.

Question 10
Two independent servers each have 99% availability, and either one can serve all requests. What is the availability of the pair, as a percentage?
%

Answers within 0.005% count.

Question 11
A service promises 99.9% availability. How many minutes of downtime does that allow in an average month?

Answers within 5% count, in any unit you choose.

Question 12
Two redundant servers, each 99.9% available, should together give 99.9999%. But both went down at once when the power supply they share failed. What did the calculation get wrong?

2.4 Back-of-the-envelope estimation

0 of 4 answered right
Open the lesson
Question 13
An application receives 86.4 million requests a day, and at its peak traffic is 2.5 times the daily average. What is the peak in requests per second?
RPS

Answers within 2% count.

Question 14
One million users each post five photos a day, and a photo is 500 KB. Without compression, how many terabytes do three years of photos need?

Answers within 10% count, in any unit you choose.

Question 15
Put these operations in order from fastest to slowest, using the latency numbers in the lesson.
  1. 1
    Round trip within a datacenter
  2. 2
    L1 cache reference
  3. 3
    Read 4 KB randomly from SSD
  4. 4
    Main memory reference
  5. 5
    Hard disk seek
  6. 6
    Packet California → Netherlands → California

Question 16
About how many requests per second is one billion requests a day, on average?
RPS

Answers within 5% count.