The 2nd exam is on Monday, in class. It will be on material from lecture 13 and on. The style will be similar to the first exam; several short questions testing basics, and only one or two longer questions.
A one-page cheat sheet is allowed.

I recommend being able to show the steps for algorithms such as BFS, DFS, Prim, Kruskal, Bellman-Ford, Dijkstra, etc, on small example graphs.

Here are annotated slides used in the review. These were based on the condensed lecture notes, but I actually removed one or two pages here and there. So if you are studying the notes, please use the original ones. Use these annotated versions only for the annotations themselves.
annotations on graphs
annotations on other topics

annotations on hw7
annotations on hw8
annotations on hw9
annotations on hw10