Note from June 29, 2020
Although we do not yet know how long the social distancing related to the Covid-19 pandemic will last, and regardless of the changes that had to be made in the evaluation of the June 2020 session in relation to what is provided for in this learning unit description, new learnig unit evaluation methods may still be adopted by the teachers; details of these methods have been - or will be - communicated to the students by the teachers, as soon as possible.
Although we do not yet know how long the social distancing related to the Covid-19 pandemic will last, and regardless of the changes that had to be made in the evaluation of the June 2020 session in relation to what is provided for in this learning unit description, new learnig unit evaluation methods may still be adopted by the teachers; details of these methods have been - or will be - communicated to the students by the teachers, as soon as possible.
5 credits
30.0 h + 15.0 h
Q2
Teacher(s)
Saerens Marco;
Language
French
Prerequisites
This course assumes that the student already masters notions of algebra covered by the course LINFO1112
The prerequisite(s) for this Teaching Unit (Unité d’enseignement – UE) for the programmes/courses that offer this Teaching Unit are specified at the end of this sheet.
The prerequisite(s) for this Teaching Unit (Unité d’enseignement – UE) for the programmes/courses that offer this Teaching Unit are specified at the end of this sheet.
Main themes
Set theory
- Set notations and operations
- Binary relations between sets: applications and link with functions in analysis
- Cardinality of a set (finite and infinite) and notion of inclusion-exclusion
- Equivalence, equivalence classes
- Introduction to the logic of the proposals
- Introduction to the logic of predicates
- Prove methods
- Mathematical induction
- Notions of Boolean Algebra
- Natural integer numbers, principle of recurrence, prime numbers, etc.
- Euclidean division, representation in a base, modulo arithmetic, representation of the integers in the computer
- Gcd, Euclid's algorithm
- Basic notions of cryptography
- counting
- permutations
- arrangements
- Recurrence relations
- Solutions of recurrence equations
- Oriented and non-oriented graphs and their matrix representations
- Bipartite graphs and matching problems
- Paths on a graph and Eulerian / Hamiltonian circuits
- Planar graphs and coloring
- Problems of shorter path
- Ranking of the nodes of a graph: PageRank
Aims
At the end of this learning unit, the student is able to : | |
| 1 |
Given the learning outcomes of the "Bachelor in Engineering" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
|
The contribution of this Teaching Unit to the development and command of the skills and learning outcomes of the programme(s) can be accessed at the end of this sheet, in the section entitled “Programmes/courses offering this Teaching Unit”.
Faculty or entity
INFO
