Hashing

Hashing is a fundamental concept in computer science, cryptography, and data structures. It involves converting a large set of data into a smaller, fixed-size value called a hash. This quiz delves into the intricacies of hashing, covering various techniques, applications, and security aspects.

14 Questions Published

Questions

Question 1 Multiple Choice (Single Answer)

What is the primary purpose of hashing?

  1. Compressing data
  2. Encrypting data
  3. Generating unique identifiers
  4. Verifying data integrity
Question 2 Multiple Choice (Single Answer)

Which hashing algorithm is widely used for password storage?

  1. MD5
  2. SHA-1
  3. SHA-256
  4. SHA-512
Question 3 Multiple Choice (Single Answer)

What is a collision in the context of hashing?

  1. When two different inputs produce the same hash value
  2. When a hash function is not able to generate a hash value
  3. When a hash value is too long
  4. When a hash value is too short
Question 4 Multiple Choice (Single Answer)

Which hashing algorithm is commonly used in blockchain technology?

  1. MD5
  2. SHA-1
  3. SHA-256
  4. SHA-512
Question 5 Multiple Choice (Single Answer)

What is the main advantage of using a hash table data structure?

  1. Fast searching and retrieval
  2. Efficient storage utilization
  3. Reduced memory usage
  4. Enhanced security
Question 6 Multiple Choice (Single Answer)

Which hashing technique is commonly used for load balancing in distributed systems?

  1. Consistent hashing
  2. Linear hashing
  3. Quadratic hashing
  4. Double hashing
Question 7 Multiple Choice (Single Answer)

What is the purpose of a salt in password hashing?

  1. To increase the length of the password
  2. To make the password more complex
  3. To prevent rainbow table attacks
  4. To generate a unique hash value
Question 8 Multiple Choice (Single Answer)

Which hashing algorithm is suitable for generating message digests?

  1. MD5
  2. SHA-1
  3. SHA-256
  4. SHA-512
Question 9 Multiple Choice (Single Answer)

What is the main disadvantage of using linear probing in hash tables?

  1. Increased collision probability
  2. Reduced search efficiency
  3. Higher memory usage
  4. Slower insertion and deletion operations
Question 10 Multiple Choice (Single Answer)

Which hashing algorithm is suitable for generating cryptographic hashes?

  1. MD5
  2. SHA-1
  3. SHA-256
  4. SHA-512
Question 11 Multiple Choice (Single Answer)

What is the purpose of a hash function in a hash table?

  1. To generate unique keys for data items
  2. To distribute data evenly across the hash table
  3. To search for data items efficiently
  4. To store data items in a compact manner
Question 12 Multiple Choice (Single Answer)

Which hashing technique is commonly used for resolving collisions in hash tables?

  1. Chaining
  2. Linear probing
  3. Quadratic probing
  4. Double hashing
Question 13 Multiple Choice (Single Answer)

What is the main advantage of using double hashing in collision resolution?

  1. Reduced collision probability
  2. Improved search efficiency
  3. Lower memory usage
  4. Faster insertion and deletion operations
Question 14 Multiple Choice (Single Answer)

Which hashing algorithm is suitable for generating fingerprints for files?

  1. MD5
  2. SHA-1
  3. SHA-256
  4. SHA-512