Introduction to Discrete Structures

This is a rigorous introduction to some topics in mathematics that underlie areas in computer science and computer engineering, including: graphs and trees, spanning trees, colorings and matchings, the pigeonhole principle, induction and recursion, generating functions, and (if time permits) combinatorial geometry. The course integrates mathematical theories with applications to concrete problems from other disciplines using discrete modeling techniques. Small student groups will be formed to investigate a modeling problem independently, and each group will report its findings to the class in a final presentation. Satisfies the Integrative Experience for BS-Math and BA-Math majors. Prerequisites: Calculus (MATH 131, 132, 233), Linear Algebra (MATH 235), and Math 300 or COMPSCI 250. For students who have not taken Math 300 or COMPSCI 250, the instructor may permit students with sufficient experience in reading and writing mathematical arguments to enroll.