MATH0491-1 : Mathematics for computing

Study Programmes 2016-2017

MATH0491-1

Mathematics for computing

Duration :

25h Th, 25h Pr

Number of credits :

Bachelor in computer science		5
Master in computer science (120 ECTS)		5
Master in computer science (60 ECTS)		5

Lecturer :

Georges Hansoul

Language(s) of instruction :

French language

Organisation and examination :

Teaching in the first semester, review in January

Units courses prerequisite and corequisite :

Prerequisite or corequisite units are presented within each program

Learning unit contents :

- Propositional logic (application : electric circuits) and first order logic (application : expert systems, formalisation of natural languages);
- Arithmetic (application : various position numeration systems);
- Naive set theory (including finite and infinite cardinal arithmetic);
- Introduction to finite structures such as groups or rings (application to cryptography);
- Classical combinatory, linear recurring equations, inclusion-exclusion principle.

Learning outcomes of the learning unit :

Its objective is twofold :
- to give a first background for various mathematical topics closely linked with theoretical computer science,
- to improve correctness of inductive reasonning, and in particular to insure a good translation from natural to formal languages.

Prerequisite knowledge and skills :

None.

Planned learning activities and teaching methods :

The exercice lessons have a double objective : first illustrate the concepts and results of the theoretical part, and second provide applications of the theory.

Mode of delivery (face-to-face ; distance-learning) :

First semester, discrete mathematics and graph theory at the Institute of Mathematics, B37.