Discrete mathematics studies mathematical structures that are discrete in nature. This is the mathematics that underlies algorithms in computing. This course will study topics in combinatorics and graph theory, in particular: counting arguments and combinatorial proof, binomial coefficients, recurrence relations, generating functions, properties of graphs, graph algorithms, planar graphs, coloring, and matching problems. Topics will be approached through theoretical and computational lenses, with an emphasis on problem-solving.
Min-Max Credit Hours: 2.0-2.0