Distributed Hash Tables

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

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

2. How does a DHT handle key lookup?

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

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

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

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

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

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

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

6. What is data replication in a DHT?

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

7. How does a DHT handle node failures?

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

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

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

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