Fundamentals of Hash Maps and Sets Quiz

Test your understanding of basic concepts related to hash maps and sets, including their operations, use cases, and core properties.

1. Hash Map Definition

   Which of the following best describes the main purpose of a hash map?

   1. To display items in a queue
   2. To store key-value pairs for fast retrieval
   3. To arrange items in a sorted sequence
   4. To store only unique values without any associated keys
   5. To process numerical data for graphs

2. Set Characteristic

   What is a distinguishing characteristic of a set compared to a list?

   1. Sets do not allow duplicate elements
   2. Sets use tuple indexing for access
   3. Sets maintain elements in insertion order
   4. Sets support sorting automatically
   5. Sets require each element to have a key

3. Hash Function Purpose

   What role does a hash function play in a hash map?

   1. It displays the values as a tree structure
   2. It translates keys to storage locations within the map
   3. It removes duplicate keys automatically
   4. It sorts the keys in alphabetical order
   5. It compresses the data for storage

4. Common Hash Map Operation

   If you want to find out if a key exists in a hash map, which operation would you use?

   1. Pop
   2. Enqueue
   3. Concat
   4. Push
   5. Lookup

5. Duplicate Handling in Sets

   What will happen if you try to add a duplicate element to a set?

   1. All elements of the set are deleted
   2. An error is thrown immediately
   3. The set becomes a list type
   4. Only one duplicate is kept alongside the original
   5. The set remains unchanged

6. Hash Map Collision

   What is a collision in the context of hash maps?

   1. When a set contains an invalid element
   2. Attempting to retrieve a key that does not exist
   3. Two different keys producing the same hash index
   4. Merging two sets with common elements
   5. A map storing only integers

7. Set Membership Check

   Given a set containing {3, 6, 8}, which operation checks if the number 6 is present?

   1. Fetching by index
   2. Concatenation
   3. Sorting
   4. Push
   5. Membership test

8. Mutable Values in Hash Maps

   What does it mean for values in hash maps to be mutable?

   1. The values can be changed after they are assigned
   2. Values cannot be numbers
   3. Each value is automatically sorted
   4. Values are removed after retrieval
   5. Values must always be unique

9. Performance of Search

   Which data structure typically allows for fastest search of elements: set, list, or tuple?

   1. Tuple
   2. Stack
   3. Set
   4. List
   5. Queue

10. Key Requirement in Hash Maps

    What type of object is typically required for use as a key in a hash map?

    1. A mutable set
    2. A string of variable length only
    3. An immutable object
    4. A list of numbers
    5. A floating-point number only