This document outlines the goals, topics, grading structure, and contact information for a discrete mathematics course taught by Professor Matthew Leingang in the spring of 2009. The course will cover set theory, algorithms, number theory, probability, recurrence, graph theory, and more. Grades are based on homework, midterms, quizzes, and a final exam. Students are encouraged to ask questions, and the professor and TAs are available to help.