Course overview
This course will develop student understanding of aspects of discrete mathematics relevant to computer science and related disciplines, including the following. Logic: propositions, truth tables, quantifiers, theorem and proof. Number systems. Sets, relations, functions. Induction. Algorithms, time complexity, analysis. Counting, permutations and combinations. Graphs, paths and cycles. Boolean algebra, circuit synthesis.
Course learning outcomes
- Find numbers of combinations and permutations of objects
- Understand Boolean algebra and the number systems used in computers
- Verify general formulae using induction
- Use combinatorial techniques to analyse algorithms and graphs
- Differentiate between polynomial and exponential time complexity of algorithms
- Understand processes involving graphs
- Effectively communicate conclusions from the application of discrete mathematical methods
Fee calculator
To display course fees, please select your status and program below:
We’re updating this Fee Calculator. It currently shows fees for programs only. Please check the relevant program for full fee details.
Study Abroad student tuition fees are available here.
Only some Postgraduate Coursework programs are available as Commonwealth Supported. Please check your program for specific fee information.
The Student Contribution amount displayed below is for students commencing a new program from 2021 onwards. If you are continuing in a program you commenced prior to 1 January 2021, or are commencing an Honours degree relating to an undergraduate degree you commenced prior to 1 January 2021, you may be charged a different Student Contribution amount from the amount displayed below. Please check the Student Contribution bands for continuing students here. If you are an international student, or a domestic student studying in a full fee paying place, and are continuing study that you commenced in 2025 or earlier, your fees will be available here before enrolments open for 2026.