Exam 1 Study Guide
Exam 1 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
Sample questions/solutions here:
CS310-sum16-Exam1-sample.pdf