Virtual Labs

What happens if you try to add a node with the same ID as an existing node?

a: The new node replaces the old one Explanation

Explanation

b: The system creates a backup node Explanation

Explanation

c: The operation fails; duplicate IDs are blocked Explanation

Explanation

d: The ring splits into two segments Explanation

Explanation

When a key is looked up, where does Chord start the search?

a: At a random node Explanation

Explanation

b: At the node with ID 0 Explanation

Explanation

c: At the node initiating the lookup Explanation

Explanation

d: At a central master node Explanation

Explanation

What is a 'predecessor' in the Chord system?

a: The node that will join the network next Explanation

Explanation

b: The node immediately counter-clockwise to a given node Explanation

Explanation

c: A list of all previous nodes in the network Explanation

Explanation

d: The node that holds the most keys Explanation

Explanation

After removing a node from the ring, which node inherits its keys?

a: Its predecessor Explanation

Explanation

b: Its successor Explanation

Explanation

c: A random node Explanation

Explanation

d: All nodes equally Explanation

Explanation

If a new node is added between two existing nodes, what happens to the keys?

a: The new node takes a portion of keys from its successor. Explanation

Explanation

b: The new node takes a portion of keys from its predecessor. Explanation

Explanation

c: The new node remains empty until new keys are added. Explanation

Explanation

d: All keys in the network are rebalanced. Explanation

Explanation

What is the primary benefit of using a finger table for lookups?

a: It guarantees a lookup will take only one hop. Explanation

Explanation

b: It allows a node to jump over large sections of the ring, speeding up the search. Explanation

Explanation

c: It stores a complete map of the entire network. Explanation

Explanation

d: It helps to balance the load of keys more evenly. Explanation

Explanation

In a ring with Nodes 0, 16, 32, and 48 (m=6, IDs 0-63), which node is responsible for key 60?

a: Node 48 Explanation

Explanation

b: Node 0 Explanation

Explanation

c: Node 16 Explanation

Explanation

d: Node 32 Explanation

Explanation

In a two-node ring (Nodes 10 and 30, m=6), what is the successor for the ID calculated for finger[4] of Node 10?

a: Node 10 Explanation

Explanation

b: Node 30 Explanation

Explanation

c: A node at ID 18 Explanation

Explanation

d: A node at ID 26 Explanation

Explanation

If a node's successor fails, how does the stabilization protocol help the node find its new successor?

a: The node asks its predecessor for help. Explanation

Explanation

b: The node consults its finger table to find the next available live node. Explanation

Explanation

c: Each node maintains a successor list (a list of several nodes that follow it), and it will try the next node in that list. Explanation

Explanation

d: The node has to wait for the failed node to come back online. Explanation

Explanation

Chord System