Both random and quadratic probing eliminate ____. a. primary clustering b. secondary clustering c. rehashing d. random probing In chaining, the average number of comparisons for an unsuccessful search is equal to the load factor. a. true b. false

____ uses a random number generator to find the next available slot. a. Linear probing b. Random probing c. Quadratic probing d. Chaining Binary search can be performed on both sorted and unsorted lists. a. true b. false If we want to design a search algorithm that is of an order less than log2n, then it ____ be comparison based. a. must b. could c. cannot d. should