Introductory description

The module will introduce central concepts in the area of discrete mathematics.

Module aims

Outline syllabus

This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.

Foundations: logic, sets, relations, functions.
The concept of algorithms and algorithmic thinking in problem solving
Summation techniques: manipulations of sums and multiple sums; finite calculus
Asymptotics and the big-Oh notation
Manipulations with the floor and ceiling functions

Learning outcomes

By the end of the module, students should be able to:

• - Understand the role of formal definitions, formal and informal mathematical proofs, and underlying algorithmic thinking, and be able to apply them in problem solving.
• - Understand the role of discrete mathematics in applications in computer science.
• - Understand the fundamental concepts of discrete mathematics.

Indicative reading list

Please see Talis Aspire link for most up to date list.

Subject specific skills

Acquiring basic knowledge in the new area (of discrete mathematics), including learning the key concepts of mathematical rigour and of the formal proof.

Transferable skills

Critical thinking and creativity