Learn the vocabulary of assigning each key to whichever node scores highest, minimizing reshuffling as nodes change.
0 / 5 completed
1 / 5
At standup, a dev mentions assigning each key to whichever node scores highest under a combined hash of the key and that node's identifier, so adding or removing one node only reshuffles the keys that were mapped to that specific node. What is this technique called?
Rendezvous hashing is exactly this: rendezvous hashing, also called highest random weight hashing, assigns each key to whichever node scores highest under a combined hash of the key and that node's identifier, computed independently for every candidate node, so adding or removing a single node only reshuffles the keys that scored highest for that specific node, leaving every other key's assignment untouched. A hash collision is an unrelated hash-table concept about two keys sharing a bucket. This highest-scoring-node-per-key approach is exactly why rendezvous hashing minimizes key reshuffling when the set of nodes changes, without needing a ring structure at all.
2 / 5
During a design review, the team uses rendezvous hashing to distribute cache keys across a set of nodes that occasionally scales up or down, specifically because computing a per-node score for each key independently means adding or removing one node only reshuffles the keys that scored highest for that node, not the whole keyspace. Which capability does this provide?
Rendezvous hashing here provides Minimal key reshuffling when the node set changes, with no ring structure required, since since each key's node assignment is decided purely by comparing independent per-node scores, removing or adding one node only affects the keys that scored highest for that specific node, leaving every other key's assignment completely untouched, unlike a naive scheme that rehashes every key relative to the current node count. A naive scheme that rehashes every key modulo the current node count reshuffles nearly the entire keyspace whenever the node count changes. This minimal-reshuffling behavior is exactly why rendezvous hashing, alongside consistent hashing, is favored for distributing keys across a node set that changes size over time.
3 / 5
In a code review, a dev notices a cache-key-distribution feature reassigns keys to nodes using a simple modulo of the key's hash by the current node count, so adding or removing a single node reshuffles nearly the entire keyspace, instead of using an independent per-node scoring scheme. What does this represent?
This is a missed rendezvous-hashing opportunity, since using rendezvous hashing's independent per-node scoring would let adding or removing one node reshuffle only the keys that scored highest for that node, instead of reshuffling nearly the whole keyspace. A cache eviction policy is an unrelated concept about discarded cache entries. This modulo-by-node-count pattern is exactly the kind of unnecessary reshuffling a reviewer flags once the node set is known to scale up or down over time.
4 / 5
An incident report shows a cache-key-distribution feature caused a massive wave of cache misses every time a node was added or removed, because it distributed keys with a simple modulo of the current node count instead of an independent per-node scoring scheme. What practice would prevent this?
Switching to rendezvous hashing's independent per-node scoring eliminates the wave of unnecessary cache misses. Continuing to distribute keys with a simple modulo of the current node count regardless of how often the node set actually scales up or down is exactly what caused the issue described in this incident. This rendezvous-hashing approach is the standard fix once the node set is confirmed to change size often enough for reshuffling cost to matter.
5 / 5
During a PR review, a teammate asks why the team reaches for rendezvous hashing instead of consistent hashing, given that consistent hashing is also designed to minimize key reshuffling when nodes are added or removed. What is the reasoning?
Rendezvous hashing computes an independent score per node for each key, needing no ring structure at all, while consistent hashing places both nodes and keys on a hash ring and typically needs virtual nodes to balance load evenly, adding some extra bookkeeping that rendezvous hashing avoids. This is exactly why both techniques minimize key reshuffling when the node set changes, differing mainly in implementation simplicity versus ring-based tooling.
What does the "Rendezvous Hashing Vocabulary" vocabulary exercise cover?
This exercise tests real IT vocabulary related to rendezvous hashing vocabulary through 5 multiple-choice questions, each built from realistic workplace sentences rather than abstract definitions.
Is this vocabulary exercise free to use?
Yes. Every exercise on CoderSlingo, including this one, is completely free — no account, sign-up, or payment required.
How many questions does this exercise have?
This exercise has 5 questions. Each one shows a real-world sentence or scenario with multiple-choice options and an explanation once you answer.
What happens after I answer a question?
You'll see immediate feedback showing whether your answer was correct, along with a short explanation of why — then a button to move to the next question, and a full results screen at the end.
Can I retry the exercise if I get questions wrong?
Yes. Once you reach the results screen, click "Try again" to reset your answers and go through the exercise from the start as many times as you like.
Do I need to create an account to take this exercise?
No account is needed. Your answers are scored in your browser during the session — nothing is saved to a server, so you can jump straight in.
Is my progress saved if I leave the page?
No — progress within an exercise resets if you navigate away or reload. Each exercise is short enough to complete in a few minutes in one sitting.
Are these vocabulary exercises connected to other topics?
Yes — browse the full vocabulary exercises hub to find related modules covering adjacent IT topics and roles.
How is this different from reading a glossary or blog article?
Exercises like this one are active recall drills — you have to choose the correct term or phrasing yourself, which builds retention faster than passively reading a definition.
Where can I find more vocabulary exercises?
Browse the full Vocabulary exercises hub for hundreds of modules covering Agile, DevOps, security, databases, architecture, and more — organised by IT role and skill.