Module Description

This module introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. It teaches the students techniques in how to think logically and mathematically and apply these techniques in solving problems.

Module Aim

The aim of this module is to provide the mathematical background to students in order to be able to formulate what a computer system is supposed to do, to prove that it does meet its specifications or to reason about its efficiency.

Module Learning Outcomes

After completion of the module students should be able to:

1. Provide overview of theory of discrete objects, starting with relations and partially ordered sets.
2. Explain and construct mathematical arguments and prove them.
3. Develop recursive algorithms based on mathematical induction
4. Plot various graphs and trees, which are widely used in software.
5. Apply knowledge about models of automata theory and the corresponding formal languages.
6. Apply knowledge about discrete mathematics in problem solving
7. Apply appropriate quantitative methods to solve particular types of business problems
8. Describe basic properties of relations
9. Explain recurrence relations, generating functions and operations on them.