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:
In this course, you will:
• Learn to work with discrete systems and graphs
• Create proofs and novel solutions
• Present your work
Delivery Method: Fully in-person
Prerequisites: Linear Algebra, Logic and Proofs, Quantitative Reasoning, or other significant coursework in Mathematics or Computer science and permission of instructor (email kmontovan@bennington.edu).
Course Level: 4000-level
Credits: 4
T/F 8:30AM - 10:20AM (Full-term)
Maximum Enrollment: 12
Course Frequency: Every 2-3 years
Categories: All courses , Computer Science , Fully In-Person , Mathematics
Tags: