Foundations of Mathematics for Computer Science II
This module consists of topics in Discrete Mathematics that are fundamental to Computer Science. 1. Modular arithmetic. 2. Permutations: Cycles, Disjoint Cycle Representations, Order, Sign. 3. Basic Counting Principles: Pigeonhole Principle, Inclusion Exclusion, Ordered and Unordered Selections with or without Repetition, Binomial and Multinomial Theorem. 4. Advanced Counting Principles: Generating Functions, Linear Recurrencies, Counting Equivalent Colourings, Symmetry Groups and Cycle Index. (STUDENTS MUST HAVE A LAPTOP COMPUTER.)
Comments
Anonymous Student
Mar 27, 2026
Plenty of time given for assignments, lecturer is sound and flexible in grading if you perform better in final than midterm. Content is difficult but not the worst when you get your head around it.
Anonymous Student
Feb 24, 2026
Great guy, just cant teach.. paired with difficult material it is quite a disaster in this course. no digital annotation, cant even see his whiteboard and the zoom lectures are useless too.. try to be up to date with the content and go to tutorials, otherwise you will fail.
Anonymous Student
Feb 14, 2026
Really hard to follow him in lectures but if you go to tutorials it's doable
Anonymous Student
Feb 14, 2026
The lecturer isn't great so I'd recommend going to tutorials religiously
Anonymous Student
Feb 14, 2026
Super funny guy. I feel like the content is very hard though and it's easy to fall behind if you don't stay on top of things. Also the content structure is not straightforward at all and he doesn't upload to brightspace which means you need to go to all lectures