MATH 2130 – Discrete Mathematics
The course covers discrete mathematical objects such as sets, relations and functions, graphs and trees. An introduction to mathematical logic and reasoning, and the concept of an algorithm and its complexity will be covered. This course is part of the IT core required for all IT majors.
MATH 1232 is a co-requisite. A ‘C’ or better in MATH 1111. Or any mathematics course that has MATH 1111 as a prerequisite.
On completion of the course, students will be able to:
- Explain the importance of discrete mathematics in computer science and information technology;
- Demonstrate an understanding of symbolic propositional and first-order predicate logic;
- Perform basic formal operations and methods of symbolic propositional and first-order predicate logic;
- Construct simple proofs in propositional logic;
- Demonstrate an understanding of Boolean algebra;
- Demonstrate an understanding of sets, relations and functions;
- Perform simple manipulations on sets, relations and functions;
- Explain the concept of an algorithm and algorithmic complexity;
- Explain difference between induction, recursion and iteration and their use in simple algorithms;
- Demonstrate an understanding of trees and graphs;
- Perform simple algorithms on trees and graphs;
- Apply these concepts to examples in computer science and information technology.
Rationale for Inclusion
This course covers the basic mathematics that is required for subsequent courses in IT. The course contributes to the following program outcome:
- Demonstrate independent critical thinking and problem solving skills;