Exam 3 will have a page of short question on graphs and hashing that should all take 30 seconds or less.

Then we will have a problem that involves a graph or a hash and we need to use it to solve a problem.

Dijkstra's and Kruskal's algorithms will not be on this test.

The next two days we will be coding up practice problem 3 from the sample exam

There will be no new material for exam 3