Analyst Integration Question:
What are couple of ways to resolve collision in hash table?
Answer:
linear probing, double hashing, and chaining. In linear probing, if bucket is already occupied then function check next bucket linearly until it find an empty one, while in chaining, multiple elements are stored in same bucket location.
| Previous Question | Next Question |
| What does the V in MVC stand for, and what does it signify? | What is difference between composition, aggregation and association? |