Which of the following operations typically has a time complexity of O(n) in the worst case for a hashmap?
All of the above
Search
Deletion
Insertion
What is a disadvantage of using a hashmap?
Keys must be immutable.
Inability to handle collisions.
Cannot iterate over elements in a specific order.
Slow search speed.
Which of the following is NOT a collision handling technique in hashmaps?
Separate Chaining
Binary Search
Linear Probing
Open Addressing
Which of these data structures is commonly used to handle collisions in hashmaps?
Heap
Binary Tree
Linked List
Queue
What does a hashmap store data in?
Sorted Array
Key-Value Pairs
Which collision resolution technique is commonly used in hashmaps?
Merge Sort
Bubble Sort
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 sort keys in ascending order based on their hash values.
To handle collisions effectively.
To generate a unique hash code for each key.
What is the purpose of a load factor in a hashmap?
To store the maximum number of key-value pairs.
To measure the efficiency of the hash function.
To determine when to resize the hashmap.
To count the number of collisions.
How are dictionaries typically implemented in programming languages?
Using linked lists for fast insertions.
Using arrays for efficient indexing.
Using binary trees for sorted key storage.
Using hashmaps to provide fast key-value lookups.
If you were designing a simple hash function for strings, which operation would likely be a core component?
Sorting the characters in the string alphabetically.
Converting characters to their ASCII codes and performing arithmetic operations.
Reversing the string.
Finding the length of the string.