Distributed Hash Tables

1. What is a Distributed Hash Table (DHT)?

A) A networking protocol for routing packets.
B) A centralized database for storing hash values.
C) A type of encryption technique.
D) A decentralized system for key-value storage and retrieval.

2. How does a DHT handle key lookup?

A) By storing all keys in a single database.
B) By assigning keys to a central server for lookup.
C) By randomly assigning keys to nodes.
D) By using a distributed algorithm to map keys to nodes in the network.

3. What is a key in the context of a DHT?

A) A keyword that describes the data content.
B) A secret cryptographic key used for encryption.
C) A server hosting the DHT service.
D) A unique identifier for data that is used to look up and store values in the DHT.

4. Which data structure is commonly used in a DHT to organize key-value mappings?

A) Linked list.
B) Hash table.
C) Queue.
D) Binary tree.

5. What is data replication in a DHT?

A) The process of encrypting data for secure transmission.
B) The process of mapping data to a specific key in the DHT.
C) The process of compressing data for efficient storage.
D) The process of storing multiple copies of data on different nodes for fault tolerance.

6. Which type of DHT ensures that nodes are only responsible for a subset of keys?

A) Random hashing.
B) Consistent hashing.
C) Asymmetric hashing.
D) Symmetric hashing.

7. How does a DHT handle node failures?

A) By blocking access to the failed node.
B) By redistributing data and keys to other nodes in the network.
C) By increasing the replication factor of the data.
D) By permanently deleting the data associated with the failed node.

8. Which protocol is often used for communication in DHT systems?

A) HTTP.
B) SMTP.
C) FTP.
D) Kademlia.

Created with That Quiz — a math test site for students of all grade levels.