This is a basic course in discrete mathematics, tailored for students in the computer science and applied math program. The course is intended to give students an exposure to formal mathematical language, the notion of proofs, and basic discrete structures such as graphs and permutations, as well as discrete probability and the probabilistic method.
Ability to understand and express ideas in a precise mathematical language.
Ability to come up with and write proofs via various proof
techniques such as direct, contrapositive, contradiction,
and induction.
Understand discrete structures such as graphs and basic combinatorial identities such as the binomial coefficients, the
factorial function, etc. and their applications in counting discrete structures.
Be introduced to basic applications of discrete structures in computer science and mathematics.