Discrete Mathematics
Course Description
Summary
Discrete mathematics studies problems that can be broken up into distinct pieces. Some examples of these sorts of systems are letters or numbers in a password, pixels on a computer screen, the connections between friends on Facebook, and driving directions (along established roads) between two cities. In this course we will develop the tools needed to solve relevant, real-world problems. Topics will include: combinatorics (clever ways of counting things), number theory and graph theory. Possible applications include probability, social networks, optimization, and cryptography.
Learning Outcomes
- Develop skills for counting the number of ways events can occur (a core skill in probability)
- Work with graph and network problems, applying definitions, theorems, and algorithms
- Create proofs and novel solutions to problems
- Advanced skills communicating mathematics both orally and in writing.
Prerequisites
Linear Algebra, Logic and Proofs, Quantitative Reasoning, or other significant coursework in Mathematics and Computer science and permission of instructor. Express interest in this course by compliting this form () by the Monday before 2000-level registration.
Please contact the faculty member : kmontovan@bennington.edu
Cross List
- Computer Science