Discrete mathematics (DM) - KAIN5M05

  • Number of hours

    • Lectures 18.0
    • Projects -
    • Tutorials 18.0
    • Internship -
    • Laboratory works -
    • Written tests 3.0

    ECTS

    ECTS 0.5

Goal(s)

The aim of the Discrete Mathematics course is to explore several fundamental notions from mathematics and see how they apply to computer science. This course is devised as an introduction to the contents of the INFO curriculum: we study a small set of key concepts (the notions of algorithm, language, coding...) codage,...) that underly many of the tools specific to computer science and studied in other courses.
1. Sets and their partitions are illustrated with examples about words and languages.
2. Functions and their inverse images yield a unified point of view over coding problems: binary encoding, compression, cryptography, error correction.
3. Equivalence relations and quotients give a general framework for studying the issues of semantics in programming languages.

Content(s)

1. Sets and partitions. Words and langages.
2. Functions and inverse images. Some coding theory.
3. Equivalence relations and quotients. Some semantic issues.

Prerequisites

No prerequisites

Test

40% CC
60% EXAM
- in person
- written test on paper
- 1h30
- adaptation to disability: extended test time
- authorized documents: a handwritten double-sided A4 sheet
- electronic devices: not permitted

Calendar

The course exists in the following branches:

  • Curriculum - INFO - Semester 5

Additional Information

Course ID : KAIN5M05
Course language(s): FR

You can find this course among all other courses.

Bibliography

Jacques Vélu. Méthodes mathématiques pour l'informatique. Dunod, Collection Sciences Sup, 4e édition (2005).