Return to the Lecture Notes Index

15-200 Lecture 34 (Monday, December 5, 2005)

Graphs

Hashing

Collection Classes

We will have use of the java api. The written portion is fast, multiple guess, and short answer, then there will be one programming section.

The programming part will not be Dijkstras, it will not be hashing because that is boring so we have prims, traversals, but Prims is a good possibility because it forces us to use union find.