Virtual Labs

What is a distributed hash table (DHT)?

a: A single table stored in a single computer's memory Explanation

Explanation

b: A table of key-value pairs stored across multiple computers Explanation

Explanation

c: A table stored in a relational database Explanation

Explanation

d: A hash table with a fixed size Explanation

Explanation

What is the primary purpose of the Chord ring?

a: To encrypt data during transmission Explanation

Explanation

b: To organize nodes in a linear sequence Explanation

Explanation

c: To distribute keys across nodes in a circular identifier space Explanation

Explanation

d: To create a backup of all keys Explanation

Explanation

In Chord, what does a 'successor' refer to?

a: The node that joined the network before the current node Explanation

Explanation

b: The first node that appears clockwise after a given ID on the Chord ring Explanation

Explanation

c: A backup node that stores a copy of all data Explanation

Explanation

d: The node with the highest identifier in the ring Explanation

Explanation

What is stored in a node's finger table?

a: All keys owned by the node Explanation

Explanation

b: IP addresses of all nodes in the network Explanation

Explanation

c: References to nodes at exponentially increasing intervals on the ring Explanation

Explanation

d: A copy of the entire Chord ring Explanation

Explanation

How does the Chord system resolve a key lookup?

a: By broadcasting the query to all nodes Explanation

Explanation

b: By iteratively querying successors or finger table entries Explanation

Explanation

c: By using a centralized lookup server Explanation

Explanation

d: By randomly guessing the node Explanation

Explanation

What happens to keys when a node leaves the Chord ring?

a: They are permanently lost Explanation

Explanation

b: They are redistributed to the node's successor Explanation

Explanation

c: They are copied to all remaining nodes Explanation

Explanation

d: They are deleted automatically Explanation

Explanation

Why is consistent hashing important for minimizing disruption when nodes join or leave?

a: It ensures that all nodes have an equal number of keys. Explanation

Explanation

b: It guarantees that only a small fraction of keys need to be moved. Explanation

Explanation

c: It prevents any keys from being moved at all. Explanation

Explanation

d: It hashes all keys to the same value for consistency. Explanation

Explanation

What is the purpose of the stabilization protocol in Chord?

a: To stop new nodes from joining the network. Explanation

Explanation

b: To periodically verify a node's immediate successor and notify the successor of the node's existence. Explanation

Explanation

c: To delete old keys from the system. Explanation

Explanation

d: To re-hash all keys in the network. Explanation

Explanation

In a Chord ring with m=7 bits, if a node has ID 42, what is the starting ID of the range for its 4th finger table entry (finger[4])?

a: 46 Explanation

Explanation

b: 50 Explanation

Explanation

c: 58 Explanation

Explanation

d: 128 Explanation

Explanation

Chord System