This unit introduces students to the language and key methods of the area of Discrete Mathematics. The focus is on mathematical concepts in discrete mathematics and their applications, with an emphasis on computation. For instance, to specify a computational problem precisely one needs to give an abstract formulation using mathematical objects such as sets, functions, relations, orders, and sequences. In order to prove that a proposed solution is correct, one needs to apply the principles of mathematical logic, and to use proof techniques such as induction. To reason about the efficiency of an algorithm, one often needs to estimate the growth of functions or count the size of complex mathematical objects. This unit provides the necessary mathematical background for such applications of discrete mathematics. Students will be introduced to mathematical logic and proof techniques; sets, functions, relations, orders, and sequences; counting and discrete probability; asymptotic growth; and basic graph theory.
3x1-hr lecture/wk for 13 weeks; 1x1-hr practice class/wk for 13 weeks; 1x1-hr tutorial/wk for 12 wks.
Examination (60%), assignments (10%), quiz (20%), online quizzes (10%).
As set out in the Junior Mathematics Handbook.
MATH1004 or MATH1904