Your upfront cost: $0
- 21 Feb 2022
The University of Notre Dame Australia is committed to delivering an excellent student experience, alongside a high standard of teaching, research, and training. As a leader in ethical education, Notre Dame aims to develop students’ critical reasoning and their ability to make ethical decisions—crucial skills to progressing their careers and leading purposeful lives. At Notre Dame, students navigate their future with an ethical education online.
QS RANKING 2022
Times Higher Education Ranking 2022
On completion of this course students should be able to achieve the following learning outcomes:
1. Apply the theory of induction to implement proofs.
2. Apply algorithms to the theory of graphs.
3. Apply concepts related to the theory of relations.
4. Solve problems in the area of number theory.
5. Communicate theoretical concepts to specialist and non-specialist audiences.
- Equivalence relations and partial orderings; algorithms; areas of number theory; graph theory.
You must have successfully completed the following subject(s) before starting this subject:
No additional requirements
This course in discrete mathematics covers relations, including equivalence relations and partial orderings; algorithms; areas of number theory, including induction and recursion; proofs; and graph theory, including an introduction to trees and their applications. It is designed to further students' mathematical content knowledge as well as their skills in communicating complex mathematical knowledge and ideas.
Continuous assessment -50% Final exam -50%
- Written class test. (30%%)
- Oral presentation on problems. (20%%)
- Final exam (50%%)
Current study term: 20 Feb 22 to 27 May 22
Check the learning management system (LMS) of your university for textbook details.