Complete the following: 1- search of either a list, an array, or a chain looks a
ID: 3868800 • Letter: C
Question
Complete the following: 1- search of either a list, an array, or a chain looks at the first item, the A second item, and so on until it finds a particular item or discovers that the item does not occur in the group. 2- A binary search of an array requires that the array be _ .. It looks first to see whether the desired item is at the of the array. If it is not, the search decides in which of the array the item can occur and repeats this strategy on only this half. 3- and a The entries in the ADT dictionary each contain two parts: a associated with that key. The dictionary identifies its entries by their 4- 5- - An entry can be added to a dictionary given its and while an entry can be retrieved or removed given only its 6- By using an iterator, you can 7- Dictionaries can organize their search keys in either all the keys or all the values in a dictionary or The search keys can be either or 8-A dictionary can be implemented using either an or a 9 Hashing is a dictionary implementation that stores entries into an array called the 10- A perfect hash function maps each search key into a location in the hash A hash function transforms an entry'sinto the of the array element that will contain the entry. table. You can find such a function if you know all possible search keys. Using a perfect hash function makes possibleimplementations of the dictionary 11-with a typical hash function, search key can map into the same location 12-Various methods are available to deal with collisions. Among them are 13- With open addressing, all entries that map into the same location are ultimately stored operations in the hash table. This occurrence is called a and within the hash table. These entries are in a sequence of locations called the Several different versions of open addressing are and Separate chaining, open addressing, Rehashing, rehash, load factor, chain of linked nodes, buckets, Linear probing, probe sequence, Quadratic probing, open addressing. separate chaining, collision, more than one, Of1), distinct, index, search key, hash table, array, duplicate, sorted, unsorted order, traverse, search key, value, search keys, half, middle, sorted, Sequential.Explanation / Answer
1. Sequential search or the Linear Search is the algorithm that search for the first item, second item, and so on until all the elements are searched.
2. In order to perform a binary search on a list, array or a list is to be sorted. It looks first to see wether the desired item is less than the middle of the array, if not then the search decides lower half of the array and repeats this strategy.
3. The entries in the ADT dictionary contains two parts they are key and a value associated with that key.
4. The dictionary identifies its entries by their keys.
5. An entry can be added to a dictionary given its Key and value while an entry can be removed given only its key
6. By using an iterator, we can display all the keys or values of the dictionary.