Assess students' ability to apply hashing concepts and hash table implementations to design and perform efficient lookup operations; scope includes selecting or designing hash functions, explaining and applying collision resolution strategies (chaining, open addressing), managing load factor and resizing, analyzing average/worst-case time and space complexity, and reasoning through example insert/lookup/delete scenarios for given data types and use-cases.