Enrolments for this year have closed. Keep exploring subjects.
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%%)