Discrete Mathematics and Algorithms ICME Refresher Course

These are the lecture notes for the ICME summer 2014 refresher course on discrete mathematics and algorithms. The material is meant to be preparatory for CME 305, the ICME core course on discrete mathematics and algorithms taught in the winter quarter. Originally, I was planning to teach material on data structures as preparation for programming-based courses. However, I felt that more material on graph algorithms would be more useful. The material on data structures is in the appendix. Please email me (arbenson@stanford.edu) with typos, comments, etc. Thanks to Victor Minden for reading these notes.