Which of the following operations typically has a time complexity of O(n) in the worst case for a hashmap?
Search
All of the above
Insertion
Deletion
In a symbol table implementation using a hashmap, what do the keys usually represent?
Names of variables or identifiers.
Data types of variables.
Values of variables.
Memory addresses of variables.
What is the time complexity of inserting a key-value pair into a hashmap in the average case?
O(log n)
O(n)
O(n log n)
O(1)
What is a disadvantage of using hashmaps when the number of elements to be stored is not known in advance?
They are not suitable for storing data in a sorted order.
They are less memory-efficient than arrays for storing a fixed number of elements.
They are more complex to implement than linked lists.
They might require resizing, which can be an expensive operation.
What does a hashmap store data in?
Linked List
Key-Value Pairs
Binary Tree
Sorted Array
Which of the following is NOT a collision handling technique in hashmaps?
Separate Chaining
Binary Search
Linear Probing
Open Addressing
What is a significant disadvantage of using a hashmap when you need to retrieve elements in a sorted order?
Hashmaps have high memory consumption.
Hashmaps cannot handle duplicate values.
Hashmaps don't inherently maintain order.
Hashmaps have slow insertion times.
Why is a good hash function important for hashmap performance?
To reduce the memory used by the hash table.
To minimize the number of comparisons required to find an element.
To allow for efficient resizing of the hash table.
To ensure that keys are evenly distributed across the hash table, reducing collisions.
Which of these data structures is commonly used to handle collisions in hashmaps?
Heap
Queue
What is the primary role of the modulo operator (%) in simple hash functions?
To map the hash code to a valid index within the array's bounds.
To generate a unique hash code for each key.
To handle collisions effectively.
To sort keys in ascending order based on their hash values.