Hashing 1

Draw the Hash Table after (17,A) is inserted.

Resolve collisions by CHAINING!

Draw the Hash Table after (27,B) is inserted.

Resolve collisions by CHAINING!

Draw the Hash Table after (37,C) is inserted.

Resolve collisions by CHAINING!

What will be the result of retrieving the value associated with the key 37 from the hash table?

• (17,A)

• (37,C)

• (27,B)

• Key not found

What happens to the hash table after removing the element with key 17?

• The element (27,B) is removed from index 3, and the hash table remains unchanged otherwise.

• The element (17,A) is removed from index 1, leaving only (37,C) in index 1.

• Both (27,B) and (17,A) are removed, leaving (37,C) at index 1.

• The element (17,A) is removed from index 1, and (37,C) is shifted to index 2.

Which of the following key-value data will not cause collision when inserting to the given Hash table?

• (9,D)

• (10,E)

• (5,F)

• (23,G)

• (2,H)

Draw a Hash table after (17,A) is inserted.

Resolve collisions by LINEAR PROBING!

Draw a Hash table after (23,B) is inserted.

Resolve collisions by LINEAR PROBING!

Draw a Hash table after (27,C) is inserted.

Resolve collisions by LINEAR PROBING!

If we attempt to insert the key-value pair (11,D) into this hash table using linear probing, at which index will it be placed?

• 0

• 1

• 2

• 3