Assess students' understanding of hash tables: how hashing functions map keys to indices and desirable properties of hash functions (uniformity, determinism, low collisions); compare and analyze separate chaining, linear probing, and quadratic probing for insertion, search, and deletion; evaluate effects of load factor, clustering, and average/worst-case time complexity. Include conceptual questions and one worked example where students choose and justify a collision-resolution strategy.