Answer Happy

Question 16 1 pts The ___ technique for handling collisions in a hash table with open addressing attempts to place colliding elements at the next available location in the hash table. sequential placement sequential probing o linear placement linear probing

Question 17 1 pts Which statement about handling collisions in a hash table using the open addressing technique is correct? O A colliding element will always be contiguous to the location in which it would normally be placed. To find an element, you must search from the hash code location until a match or an element with a different hash code is found. To remove an element, you simply empty the slot at which you find it. There may be some elements with different hash codes that lie on the same probing sequence.

Question 18 1 pts Which of the following statements about handling collisions in a hash table using the separate chaining and open addressing techniques is NOT correct? The implementation of separate chaining technique is simpler than the implementation of the open addressing technique. The separate chaining technique is simpler to understand than the open addressing technique. The separate chaining technique requires the storage of links while open addressing does not. The separate chaining technique requires less memory use than open addressing.

Question 19 1 pts Which statement about handling collisions in a hash table using the open addressing technique is NOT correct? O A colliding element may not be contiguous to the location in which it would normally be placed. To find an element, you must search from the hash code location until a match or an empty slot is found. To remove an element, you simply empty the slot at which you find it. There may be some elements with different hash codes that lie on the same probing sequence.