The document discusses hashing and hash tables. It defines hashing as a technique where the location of an element in a collection is determined by a hashing function of the element's value. Collisions can occur if multiple elements map to the same location. Common techniques for resolving collisions include chaining and open addressing. The Java Collections API provides several implementations of hash tables like HashMap and HashSet.

1. Chapter 17 Hashing

7. FIGURE 17.1 A simple hashing example

24. FIGURE 17.2 The chaining method of collision handling

25. FIGURE 17.3 Chaining using an overflow area

27. FIGURE 17.4 Open addressing using linear probing

29. FIGURE 17.5 Open addressing using quadratic probing

31. FIGURE 17.6 Open addressing using double hashing

37. FIGURE 17.7 Open addressing and deletion

39. TABLE 17.1 Operations on the Hashtable class

40. TABLE 17.1 Operations on the Hashtable class (cont.)

41. TABLE 17.2 Operations on the HashSet class

42. TABLE 17.3 Operations on the HashMap class

43. TABLE 17.4 Operations on the IdentityHashMap class

44. TABLE 17.5 Operations on the WeakHashMap class

45. TABLE 17.6 Additional operations on the LinkedHashSet class

46. TABLE 17.7 Additional operations on the LinkedHashMap class