Hash Tables
1. What is it called when multiple keys are mapped to the same index in a hash table?
2. Which of the following are commonly used techniques for resolving collisions in hash tables?
3. In separate chaining, how are multiple keys that hash to the same index typically handled?
4. In linear probing, what is the usual action when the initially computed slot is occupied?
5. What is a major disadvantage of linear probing when many consecutive table positions become occupied?
6. In quadratic probing, which expression is commonly used as the probing offset?
7. Which collision-resolution method stores collided entries outside the main table slots, typically in linked lists or other collections?
8. Why can separate chaining continue to store more elements than the number of table slots?
9. Which statement best distinguishes open addressing from separate chaining?