Week 9 - Hash Tables

Learning objectives

• Describe how to construct a hash function for various types of data
• Implement a hash table
• Represent a graph with an adjacency matrix or adjacency list
• Execute basic search-based algorithms in a graph

Class Schedule

Day 1

• Memorial Day - No class

Day 2

• Hash Tables (Ch 33.6-33.8)

Todo:

• Do this HashTableWS. Then check this key

Day 3

• Hash Tables (Ch 33.9-33.12)

Day 4

• Graphs & Searches By Hand

Todo:

• Do GraphsWS. Then check this key

Recommended Schedule

Day 1

• Enjoy Memorial Day!

Day 2

• Hash Tables (Ch 33.6-33.8)
• Do this HashTableWS. Then check this key

Day 3

• Hash Tables (Ch 33.9-33.12)

Day 4

• Graphs & Searches By Hand
• Do GraphsWS. Then check this key

Hash Tables

Finish reading Ch 33.

After 33.6, try the worksheet linked above to get make sure you understand collisions and probing.

These optional videos review the material:

Graphs

Read Ch 34.1-34.4, then skip ahead to 34.5-34.6, but don't worry about the code in 34.5-34.6 yet. Just focus on the process of exploring a graph in either breadth-first or depth-first order.

Then do the worksheet linked above to practice with the concepts.

This video reviews the material: