- 6
- Units
- 26
- Lessons
- 0
- Labs
The language of computer science: sets, relations, logic, combinatorics, graphs and trees - essential for algorithms and data structures.
What you'll learn
The key areas this subject covers, mapped to the official curriculum.
- Set theory, cardinality and summations
- Integers, modular arithmetic and matrices
- Propositional logic and proof techniques
- Induction, recursion and recursive algorithms
- Counting, probability, relations and graphs
Course units
The structured path through this subject.
- 1
Basic Discrete Structures
Sets, set operations, cardinality, power sets, sequences and summations - the raw material of discrete mathematics.
4 topics · 4 lessons available
- 2
Integers and Matrices
Divisibility, primes, the Euclidean algorithm, modular arithmetic and matrix algebra.
4 topics · 4 lessons available
- 3
Logic and Proof Methods
Propositional logic, logical equivalences, quantifiers and the standard proof techniques of mathematics.
5 topics · 5 lessons available
- 4
Induction and Recursion
Mathematical induction, strong induction, the well-ordering principle and recursive definitions.
4 topics · 4 lessons available
- 5
Counting and Discrete Probability
Sum and product rules, permutations, combinations, the binomial theorem, the pigeonhole principle and basic probability.
5 topics · 5 lessons available
- 6
Relations and Graphs
Relations and their properties, equivalence relations, partial orders, and the terminology of graphs.
4 topics · 4 lessons available
Subject details
- Code
- CSC-165
- Credit hours
- 3
- Semester
- Semester II
- Category
- theory