Hash Tables and Dictionaries
Computing · JC 2 · Advanced Data Structures and Algorithms · 1.º Período

Hash Tables and Dictionaries

An exploration of hash functions, collision resolution techniques, and the implementation of dictionaries. Students will evaluate the efficiency of hashing for data storage.

MOE Syllabus OutcomesMOE H2 Computing (Syllabus 9569), Section 1: Algorithms and Data Structures - 1.2 Data Structures (Hash Tables)MOE H2 Computing (Syllabus 9569), Section 1: Algorithms and Data Structures - 1.1 Algorithms (Hashing and Collision Resolution)

About This Topic

An exploration of hash functions, collision resolution techniques, and the implementation of dictionaries. Students will evaluate the efficiency of hashing for data storage.

Key Questions

  1. What makes a good hash function?
  2. How do linear probing and chaining resolve collisions?
  3. When should a hash table be used instead of a BST?

Active Learning Ideas

See all activities→

Activities & Teaching Strategies

See all activities

More in Advanced Data Structures and Algorithms

Binary Search Trees

Students will implement and traverse Binary Search Trees (BST). They will analyse the time complexity of insertion, deletion, and search operations.

8 methodologies

Graphs and Shortest Path Algorithms

Students will represent graphs using adjacency matrices and lists. They will implement algorithms such as breadth-first search and Dijkstra's algorithm.

8 methodologies

Object-Oriented Programming (OOP) Principles

A deep dive into encapsulation, inheritance, and polymorphism. Students will design robust software solutions using OOP paradigms in Python.

8 methodologies

Edited by Adriana Perusin, Editor-in-Chief, Flip Education
Synthesized by Flip Education from Lyman's Think-Pair-Share collaborative-discussion routine (1981)