CSE1002

Discrete Mathematics for Computer Science

Core Courses

A foundational course in discrete mathematics covering logic, proof techniques, set theory, relations, combinatorics, number theory, graph theory, and probability. Provides the mathematical rigour essential for algorithm design, cryptography, and theoretical computer science.

11 Chapters

Chapters

Ch 1FREE

Fundamentals of Logic and Mathematical Proof

49 min
Ch 2FREE

Functions, Relations, and Set Mappings

9 min
Ch 3

Comparing Sizes of Sets and the Pigeonhole Principle

12 min

Unlock all chapters — plans from $6/mo

Ch 4

Understanding Equivalence Relations and Partitions

11 min

Unlock all chapters — plans from $6/mo

Ch 5

Ordering, Lattices, and Algebraic Structures

42 min

Unlock all chapters — plans from $6/mo

Ch 6

Combinatorial Counting and Set Operations

7 min

Unlock all chapters — plans from $6/mo

Ch 7

Prime Factorization, Number Theory Algorithms, and Cryptography

15 min

Unlock all chapters — plans from $6/mo

Ch 8

Foundations of Probability Theory

13 min

Unlock all chapters — plans from $6/mo

Ch 9

Graphs and Network Structures

9 min

Unlock all chapters — plans from $6/mo

Ch 10

Advanced Graph Concepts and Network Flows

14 min

Unlock all chapters — plans from $6/mo

Ch 11

Logic Systems, Proof Methods, and Formal Foundations

15 min

Unlock all chapters — plans from $6/mo