HashTable True/False. T/F: The expected runtime of .add() for a HashTable depend

Question

HashTable True/False. T/F: The expected runtime of .add() for a HashTable depends ·T/F: The expected runtime of .add( ) for a HashTable depends . T/F. The expected runtime of .remove( ) for a HashTable de- . T/F. The expected runtime of .remove( ) for a HashTable de- . T/F. The expected runtime of .contains( ) for a HashTable is which collision-handling scheme is used on on the cur rent load factor of the hash table ends on which collision-handling scheme is used pends on the current load factor of the hash table always O(1) regardless of which collision-handling scheme is used

Explanation / Answer

1.The expected runtime of .add() for a HashTable depends on which collision-handling schemes is used.

True

Explanation:

The performance add operation varies with respect to the collision-handling schemes is used, and it also effect the runtime also.

2.

The expected runtime of .add() for a HashTable depends on the current load factor of the hash table.

True

Explanation:

3.

The expected runtime of .remove() for a HashTable depends on which collision-handling schemes is used.

True

Explanation:

The performance remove operation varies with respect to the collision-handling schemes is used, and it also effect the runtime also.

Here rehashing is applied.

4.

The expected runtime of .remove() for a HashTable depends on the current load factor of the hash table.

True

Explanation:

5.

The expected that the runtime of .contains() for a HashTable O(1) regardless of which collision-handling scheme is used.

True

Explanation:

Contains() always same because it is only for checking purpose.

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.