Overview
Scope: * Mathematical methods for designing correct and efficient programs.* Mathematics for algorithm analysis.* Logic for proving and verification.Topics: * Introduction to set and relation theory* Propositional logic and boolean algebras* Induction, recursion and recurrence relations* Order of growth of functions.* Structured counting (combinatorics)* Discrete probability* Graph theory* Trees for … For more content click the Read More button below.
Delivery
In-person - Standard (usually weekly or fortnightly)
Course Outline
To access course outline please visit below link (Please note that access to UNSW Canberra course outlines requires VPN):
Fees
Type | Amount |
---|---|
Commonwealth Supported Students (if applicable) | $1003 |
Domestic Students | $4560 |
International Students | $6030 |
Pre-2019 Handbook Editions
Access past handbook editions (2018 and prior)