Which of the following operations typically has a time complexity of O(n) in the worst case for a hashmap?
Insertion
Deletion
All of the above
Search
What is the primary role of the modulo operator (%) in simple hash functions?
To handle collisions effectively.
To sort keys in ascending order based on their hash values.
To map the hash code to a valid index within the array's bounds.
To generate a unique hash code for each key.
Which of the following is NOT a collision handling technique in hashmaps?
Separate Chaining
Binary Search
Open Addressing
Linear Probing
In a symbol table implementation using a hashmap, what do the keys usually represent?
Values of variables.
Memory addresses of variables.
Names of variables or identifiers.
Data types of variables.
Which of these is NOT a desirable property of a good hash function?
It should be computationally expensive to calculate.
It should distribute keys uniformly across the hash table.
It should minimize collisions as much as possible.
It should be deterministic (same input always yields the same output).
What is a key advantage of using a hashmap over a sorted array for searching?
Hashmaps offer faster search on average.
Hashmaps allow duplicate keys.
Hashmaps maintain data in sorted order.
Hashmaps consume less memory.
What is a significant disadvantage of using a hashmap when you need to retrieve elements in a sorted order?
Hashmaps cannot handle duplicate values.
Hashmaps have high memory consumption.
Hashmaps have slow insertion times.
Hashmaps don't inherently maintain order.
In hashmap collision resolution, what does separate chaining involve?
Creating linked lists at each index of the hash table to store colliding elements.
Storing colliding elements in a separate overflow area.
Using a secondary hash function to resolve collisions.
Finding the next available empty slot in the hash table.
You want to update the value associated with a key in a hashmap. What is the general process involved?
Search for the key sequentially, and update the value when found.
Calculate the hash of the key, find the corresponding bucket, and directly modify the value.
Delete the existing key-value pair, then insert a new one with the updated value.
Hashmaps do not support value updates; you need to create a new hashmap.
Which of these data structures is commonly used to handle collisions in hashmaps?
Binary Tree
Heap
Linked List
Queue