Distributed Hash Tables

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

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

2. How does a DHT handle key lookup?

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

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

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

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

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

5. What is data replication in a DHT?

A) The process of mapping data to a specific key in the DHT.
B) The process of compressing data for efficient storage.
C) The process of encrypting data for secure transmission.
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) Asymmetric hashing.
B) Consistent hashing.
C) Symmetric hashing.
D) Random hashing.

7. How does a DHT handle node failures?

A) By redistributing data and keys to other nodes in the network.
B) By blocking access to the failed node.
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) Kademlia.
B) HTTP.
C) SMTP.
D) FTP.

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