Exam 0 is closed book and closed notes. Here are the topics covered:

Analyze Big-O and Big-Theta
Maps, HashTables
Graphs and Trees
Interval scheduling
Interval partitioning
Greedy Algorithms (Concept)
Shortest Path, Dijkstra's
Minimum spanning trees, Prim Demo, Kruskal Demo
UnionFind
Huffman coding
Divide and Conquer (Concept)

Sample questions/solutions here:
CS310-sum15-Exam0-sample.pdf