Assess students' understanding of hash functions—purpose, key properties (deterministic mapping, uniform distribution, fixed-size output), simple hash methods, and the nature of collisions—then evaluate and compare collision resolution strategies: chaining and open addressing (linear probing, quadratic probing, double hashing). Questions should probe conceptual knowledge, performance trade-offs (time/space, clustering, load factor), and include a short worked example requiring resolution of collisions in a small hash table.