ThatQuiz Test Library Take this test now
Distributed Hash Tables
Contributed by: Parkin
  • 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 decentralized system for key-value storage and retrieval.
D) A type of encryption technique.
  • 2. How does a DHT handle key lookup?
A) By using a distributed algorithm to map keys to nodes in the network.
B) By storing all keys in a single database.
C) By randomly assigning keys to nodes.
D) By assigning keys to a central server for lookup.
  • 3. What is a key in the context of a DHT?
A) A secret cryptographic key used for encryption.
B) A keyword that describes the data content.
C) A unique identifier for data that is used to look up and store values in the DHT.
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) Binary tree.
C) Linked list.
D) Queue.
  • 5. What is data replication in a DHT?
A) The process of encrypting data for secure transmission.
B) The process of storing multiple copies of data on different nodes for fault tolerance.
C) The process of mapping data to a specific key in the DHT.
D) The process of compressing data for efficient storage.
  • 6. Which type of DHT ensures that nodes are only responsible for a subset of keys?
A) Random hashing.
B) Asymmetric hashing.
C) Consistent hashing.
D) Symmetric hashing.
  • 7. How does a DHT handle node failures?
A) By permanently deleting the data associated with 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 blocking access to the failed node.
  • 8. Which protocol is often used for communication in DHT systems?
A) HTTP.
B) Kademlia.
C) SMTP.
D) FTP.
Created with That Quiz — a math test site for students of all grade levels.