Question

The material of this section assumes that search keys are unique. However, only small modifications are needed to allow the techniques to work for search keys with duplicates. Describe the necessary changes to insertion, deletion, and lookup algorithms, and suggest the major problems that arise when there are duplicates in each of the following kinds of hash tables: (a) simple (b) linear (c) extensible

Answer 1

The description of the given points can be described as follows:

Step-by-step explanation:

A hash table is a specific array, which is used to contain items of key value. It uses a hash to calculate an index of an array, which inserts an item, and the given point can be described as follows:

• In option a, It includes several duplicates, which is a large number of unavailable tanks, although there is a large overflow list for the used tanks.
• In option b, multiple copies are painful to scan because we have to read and understand rather than a single line.
• In option c, It can break frequently, if there are several exact copies.