Back to modules
Formal Foundations 2
This module is intended to introduce a range of topics in discrete mathematics and automata theory which are frequently used in Computer Science. Topics include predicate calculus, elementary number theory and combinatorics, and an introduction to finite automata.
5.01 review
Workload
2.0
Difficulty
1.0
Teaching
5.0
Fairness
5.0
Interest
5.0
Comments
A
Anonymous Student
Apr 30, 2026
Workload 2·Difficulty 1·Teaching 5·Fairness 5·Interest 5
took this as Discrete Maths. Love at first sight.