CMSC 145: Discrete Mathematics Bard College Sven Anderson Spring 2012

Course Description

Discrete mathematics provides a quantitative understanding of discrete entities and discrete processes. The ideas of discrete math underlie the science and technology of our time and these ideas inform disciplines such as computer science, environmental science, genetics, and cognitive science. This course links computer science with mathematics and provides a bridge to more advanced topics in data structures, artificial intelligence, algorithms, and computational theory. It will help you learn to think more abstractly, to apply logic and proof, and to analyze algorithms, discrete structures, and combinatoric problems. We will balance our theoretical approach with numerous examples drawn from areas of computer science. Prerequisite: pre-calculus mathematics.

Course Info

Time: TR, 10:10-11:30am
Place: RKC 101
Prof: Sven Anderson
Office: RKC 205
Tel: 752-2322
Email: sanderso@bard.edu

What's New

• Syllabus

Last modified: