1. rehashing resolving a collision by computing a new hash location from a hash function that manipulates the original location rather then the elements key is correct
2. bucket a collection of elements associated with a particular hash location is correct
3. collision a condition resulting when two or more keys produce the same hash location is correct
4. radix the number of possibilities for each position; the digits in a number system is correct
5. big-0 notation a notation that expresses computing time (complexity) as the term in a function that increases most rapidly relative to the size of a problem is correct
6. folding a hash method that breaks the key into several pieces and concatenates or exclusive-ORs some of them to form a hash value is correct
7. logarithmic order for an algorithm, when the Big-0 work expression can be expressed in terms of the logarithm of N, where N is the number of values in a data set is correct
8. clustering the tendency of elements to become unevenly distributed in a hash table; with many elements clustering around a single hash location is correct
9. binary search a search algorithm for sorted lists that involves dividing the list in half and determining, by value comparison, whether the item would be in the upper or lower half; the process is performed repeatedly until either the item is found or it is determined that the item is not on the list is correct
10. quadratic probing resolving a hash collision by using the rehashing formula (HashValue + I*I) % array_size, where I is the number of times the rehash function has been applied is correct
11. hash function a function used to manipulate the key of an element in a list to identify its location in the list is correct
12. collating sequence the ordering of the elements of a set or series, such as the characters (values) in a character set is correct
13. sorting arranging the components of a list in order (for instance, words in alphabetical order, numbers in ascending or descending order) is correct
14. linear probing resolving a hash collision by sequentially searching a hash table beginning at the location return by the hash function is correct
15. hashing the technique used for ordering and accessing elements in a list in a relatively constant amount of time by manipulate the key to identify its location in the list is correct
