Why Collision Handling Using Chaining in DSA Javascript?

The Big Idea

What if your keys could never get lost even if they look the same? Discover how chaining makes that possible!

The Scenario

Imagine you have a big box where you want to store your keys, but sometimes two keys look very similar and you accidentally put them in the same small pocket inside the box.

When you try to find a key, you get confused because multiple keys are in the same pocket.

The Problem

Manually checking each pocket for the right key takes a lot of time and can cause mistakes.

You might lose keys or spend too long searching because you don't have a clear way to separate similar keys.

The Solution

Collision Handling Using Chaining solves this by making each pocket a small list where all similar keys are kept.

When you want to find a key, you only check the small list in that pocket, which is much faster and organized.

Before vs After

✗ Before

function insert(key) {
  if (box[pocket] === undefined) {
    box[pocket] = key;
  } else {
    // Overwrites existing key
    box[pocket] = key;
  }
}

✓ After

function insert(key) {
  if (box[pocket] === undefined) {
    box[pocket] = [];
  }
  box[pocket].push(key);
}

What It Enables

This method allows storing multiple items in the same place without losing any, making searching and storing fast and reliable.

Real Life Example

Think of a school locker where many students have the same locker number but different compartments inside to keep their things separate and safe.

Key Takeaways

Manual storage fails when multiple items share the same spot.

Chaining uses lists inside each spot to keep all items safely.

This keeps data organized and easy to find even with collisions.

Practice

1. What is the main idea behind collision handling using chaining in hash tables?

easy

A. Resize the hash table immediately after every insertion

B. Replace the existing element with the new one when a collision happens

C. Store multiple elements in a linked list at the same index when collisions occur

D. Use a secondary hash function to find a new index

Solution

1. Step 1: Understand collision in hash tables

   When two keys hash to the same index, a collision occurs.

2. Step 2: How chaining handles collisions

   Chaining stores all collided elements in a linked list at that index.

3. Final Answer:

   Store multiple elements in a linked list at the same index when collisions occur -> Option C

4. Quick Check:

   Chaining = linked list at index [OK]

Hint: Chaining means linked list at one index for collisions [OK]

Common Mistakes:

• Thinking chaining replaces old values
• Confusing chaining with open addressing
• Assuming resizing happens on every collision

2. Which of the following is the correct way to initialize a hash table with chaining in JavaScript?

easy

A. const table = new Array(10).fill([]);

B. const table = Array.from({ length: 10 }, () => []);

C. const table = new Array(10);

D. const table = Array(10).fill(null);

Solution

1. Step 1: Understand array initialization with unique lists

   Using fill([]) fills all indexes with the same array reference.

2. Step 2: Use Array.from with a function to create unique arrays

   Array.from({ length: 10 }, () => []) creates a new empty array at each index.

3. Final Answer:

   const table = Array.from({ length: 10 }, () => []); -> Option B

4. Quick Check:

   Unique arrays per index = const table = Array.from({ length: 10 }, () => []); [OK]

Hint: Use Array.from with function for unique arrays [OK]

Common Mistakes:

• Using fill([]) causes all indexes to share one array
• new Array(10) leaves slots undefined
• Filling with null does not create lists for chaining

3. Consider the following JavaScript code for inserting keys into a hash table with chaining:

const table = Array.from({ length: 5 }, () => []);
function hash(key) { return key % 5; }

// Insert keys
[7, 12, 17].forEach(key => {
  const index = hash(key);
  table[index].push(key);
});

console.log(table);

What is the output printed?

medium

A. [[7, 12, 17], [], [], [], []]

B. [[], [], [], [7, 12, 17], []]

C. [[], [7], [12], [17], []]

D. [[], [], [7, 12, 17], [], []]

Solution

1. Step 1: Calculate hash index for each key

   7 % 5 = 2, 12 % 5 = 2, 17 % 5 = 2.

2. Step 2: Insert keys at index 2

   All keys go into table[2], so table[2] = [7, 12, 17].

3. Final Answer:

   [[], [], [7, 12, 17], [], []] -> Option D

4. Quick Check:

   All keys at index 2 = [[], [], [7, 12, 17], [], []] [OK]

Hint: Calculate key % size to find index [OK]

Common Mistakes:

• Miscomputing modulo results
• Inserting keys at wrong indexes
• Confusing array positions in output

4. The following code attempts to insert keys into a hash table with chaining but has a bug:

const table = new Array(3).fill([]);
function hash(key) { return key % 3; }

function insert(key) {
  const index = hash(key);
  table[index].push(key);
}

insert(1);
insert(4);
insert(7);
console.log(table);

What is the bug and how to fix it?

medium

A. Bug: All indexes share the same array; Fix: Use Array.from with () => []

B. Bug: hash function is incorrect; Fix: Use key % 10 instead

C. Bug: push method is wrong; Fix: Use unshift instead

D. Bug: table size is too small; Fix: Increase size to 10

Solution

1. Step 1: Identify the bug with fill([])

   Using fill([]) assigns the same array reference to all indexes.

2. Step 2: Fix by creating unique arrays per index

   Use Array.from({ length: 3 }, () => []) to create separate arrays.

3. Final Answer:

   Bug: All indexes share the same array; Fix: Use Array.from with () => [] -> Option A

4. Quick Check:

   fill([]) shares arrays, Array.from creates unique ones [OK]

Hint: Avoid fill([]); use Array.from with function [OK]

Common Mistakes:

• Changing hash function unnecessarily
• Using wrong array methods
• Ignoring shared reference problem

5. You have a hash table of size 4 using chaining. You insert keys [3, 7, 11, 15, 19]. The hash function is key % 4. After all insertions, which index has the longest chain and what is its content?

medium

A. Index 3: [3, 7, 11, 15, 19]

B. Index 1: [3, 7, 11, 15, 19]

C. Index 3: [3, 7, 11, 15]

D. Index 3: [3, 7, 11]

Solution

1. Step 1: Compute hash index for each key

   3 % 4 = 3, 7 % 4 = 3, 11 % 4 = 3, 15 % 4 = 3, 19 % 4 = 3.

2. Step 2: Insert all keys at index 3

   All keys go into table[3], so chain is [3, 7, 11, 15, 19].

3. Final Answer:

   Index 3: [3, 7, 11, 15, 19] -> Option A

4. Quick Check:

   All keys mod 4 = 3, chain length 5 [OK]

Hint: All keys mod 4 equal 3, so chain at index 3 [OK]

Common Mistakes:

• Miscomputing modulo for some keys
• Assuming keys spread across indexes
• Forgetting all keys collide at same index