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 algorithmic applications
Please note that the University reserves the right to vary student fees in line with relevant legislation. This fee information is provided as a guide and more specific information about fees, including fee policy, can be found on the fee website.
For advice about fees for courses with a fee displayed as "Not Applicable", including some Work Experience and UNSW Canberra at ADFA courses, please contact the relevant Faculty.
Where a Commonwealth Supported Students fee is displayed, it does not guarantee such places are available.