We will discuss methods of data lookup, with a focus on hash sets / tables, including motivation, properties, and variants. This will be in the context of a “CS 2” or data structures course. We will assume a basic familiarity with programming and comfort with implementing resizable lists; as well as knowledge of (but not necessarily comfort with) asymptotic analysis.