Module Overview

Discrete Mathematics II

This module builds on and expands the material covered in the previous Discrete Mathematics 1 module.  It introduces the student to mathematical logic, topics in number theory and graph theory.

Module Code

MATH 2811

ECTS Credits


*Curricular information is subject to change


Propositional logic, truth tables, implication, logical equivalence, Predicate logic, Syntax, Semantics, translations, proof techniques.


Number Theory

Integers, Induction and Recursion, divisibility, prime numbers, Euclidean Algorithm, equivalence relations, the integers modulo n, applications to Coding Theory and Cryptology.


Graph Theory

Definitions, applications and uses in computing, isomorphic graphs, planar graphs, computer representation of graphs, Euler paths and Hamiltonian cycles, trees, tree traversal algorithms, decision trees.

2 hours of lectures and 1 hour tutorial session per week.
The lectures will provide theoretical material which will be underpinned by many examples to demonstrate the use of this material. The tutorial sessions will provide students with supervised practice time using appropriate exercises.


Module Content & Assessment
Assessment Breakdown %
Formal Examination70
Other Assessment(s)30