Which of the following is NOT a collision handling technique in hashmaps?
Open Addressing
Binary Search
Linear Probing
Separate Chaining
Which of these data structures is commonly used to handle collisions in hashmaps?
Queue
Heap
Binary Tree
Linked List
Which of these is NOT a desirable property of a good hash function?
It should be deterministic (same input always yields the same output).
It should be computationally expensive to calculate.
It should minimize collisions as much as possible.
It should distribute keys uniformly across the hash table.
What is the time complexity, in the average case, for searching for a key in a well-implemented hashmap?
O(1)
O(log n)
O(n log n)
O(n)
What does a hashmap store data in?
Key-Value Pairs
Sorted Array
Which of these is a disadvantage of open addressing compared to separate chaining in hashmaps?
Cannot handle a large number of collisions efficiently.
Requires more complex implementation compared to chaining.
Increased memory usage due to linked lists.
Clustering of elements can lead to performance degradation.
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 don't inherently maintain order.
Hashmaps cannot handle duplicate values.
Hashmaps have slow insertion times.
How are dictionaries typically implemented in programming languages?
Using linked lists for fast insertions.
Using binary trees for sorted key storage.
Using arrays for efficient indexing.
Using hashmaps to provide fast key-value lookups.
In a symbol table implementation using a hashmap, what do the keys usually represent?
Memory addresses of variables.
Data types of variables.
Values of variables.
Names of variables or identifiers.
In hashmap collision resolution, what does separate chaining involve?
Storing colliding elements in a separate overflow area.
Using a secondary hash function to resolve collisions.
Creating linked lists at each index of the hash table to store colliding elements.
Finding the next available empty slot in the hash table.