MA3030 Introduction to Combinatorics and Its Applications

Provides a thorough grounding in elementary combinatorics and its applications to computer science and discrete probability theory to students of computer science who concurrently take MA3025, Logic and Discrete Mathematics. Topics from combinatories include fundamental counting rules, binomial and multinomial theorems, the pigeonhole and inclusion/exclusion principles, and homogeneous recurrence relations. Elementary discrete probability is covered, up to the expectation of a discrete random variable.

Corequisite

MA3025

Lecture Hours

4

Lab Hours

1

Quarter Offered

  • As Required