Draft - Hash Table Implementation Layers
Authoring skeleton - differentiated CS113 implementation
Three short topics
- Hash functions and collisions.
- Chaining and comparison with open addressing.
- Set/map behavior, load factor, and lookup costs.
PBL context
Observe Train cargo maps or collection item IDs. Prototype a student hash index without replacing the existing application store.
Implementation layers to author
- Bucket selection with valid indices.
- Chained put/get/remove with key equality and replacement semantics.
- Advanced continuation: resizing or open addressing with deletion rules.
Evidence checklist to author
Force collisions; test missing keys, replacement, deletion, and resize preservation. Compare operation counts and define null-key policy. Do not claim worst-case constant-time lookup.
Publication checklist
Complete exercises and checks before assigning courses.csa.week, removing draft/hide flags, or enabling submissions.
Code Runner Challenge
Authoring draft - hash-table exercise is not ready
View IPYNB Source
// CODE_RUNNER: Authoring draft - hash-table exercise is not ready
public class HashTableDraft {
public static void main(String[] args) {
throw new UnsupportedOperationException("Draft: author collision handling and tests before publication.");
}
}
HashTableDraft.main(null);
Lines: 1
Characters: 0
Output
Click "Run" in code control panel to see output ...