Overview
The main themes of this topic are logic and proof, induction and recursion, discrete structures, algorithms and their analysis, and applications. Mathematical reasoning, combinatorial analysis and algorithmic thinking are carefully blended and balanced to provide students with skills and knowledge necessary for a successful career in science and technology.
Topic availabilities
To view topic availabilities, select an availability from the drop down, towards the top right of the screen.
Tuition pattern
To view tuition patterns, select an availability from the drop down, towards the top right of the screen.
Aims
This topic builds a solid discrete mathematics and logic foundation for a computer scientist.
Learning outcomes
On completion of this topic you will be expected to be able to:
1.
Understand and apply formal logic system on which mathematical reasoning is based
2.
Analyse and construct valid mathematical arguments - proofs - and understand mathematical statements - theorems
3.
Utilise important discrete data structures such as sets, relations, discrete functions, graphs and trees
4.
Use various problem-solving strategies including algorithmic thinking (both iterative and recursive) and various counting techniques to create appropriate solutions to computing problems
5.
Understand the importance of formal mathematical structures and techniques for computing applications
Assessments
To view assessment information, select an availability from the drop down, towards the top right of the screen.
Current students should refer to FLO for detailed assessment information, including due dates. Assessment information is accurate at the time of publishing.
For policy details, visit Assessments