Discrete Mathematics

• • 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:

• UND-MATH5001-Linear Algebra

Additional requirements

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%%)