MAT1830 · Discrete mathematics for computer science

Overview

This unit introduces fundamental discrete mathematics topics including combinatorics, sets, relations and functions; methods of logic and proof, especially proof by induction; probability theory, Bayes' theorem; recursion; recurrence relations; trees and other graphs. It establishes the mathematical basis required for studies in Computer Science and Software Engineering.

Areas of study: Applied mathematics Computational science Mathematics Software engineering

Offerings

Assessment

The Handbook does not list a final examination among the assessment items. That is not a guarantee there is none.

Requisites

Learning outcomes

1. Identify basic methods of proof, particularly induction, and apply them to solve problems in mathematics and computer science;
2. Manipulate sets, relations, functions and their associated concepts, and apply these to solve problems in mathematics and computer science;
3. Use and analyse simple first and second order recurrence relations;
4. Use trees and graphs to solve problems in computer science;
5. Apply counting principles in combinatorics;
6. Describe the principles of elementary probability theory, evaluate conditional probabilities and use Bayes' Theorem.

Workload

Minimum total expected workload to achieve the learning outcomes for this unit is 144 hours per semester typically comprising a mixture of scheduled online and face to face learning activities and independent study. Independent study may include associated reading and preparation for scheduled activities. Applied sessions start from Week 2 of the semester.

Student experience, not official rules. Nothing here changes what the Handbook says.