Discrete structures

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.

Main themes

• Notions of number theory: natural integers, recurrence principle, Euclidean division, prime numbers, gcd, modular arithmetic.
• Combinatorial analysis: counting, permutations, arrangements, combinations, recurrence equations.
• Notions of cryptography: keys, encryption algorithms and protocols, symmetric and asymmetric cryptography, signature, hashing.
• Notions of graph theory: directed and undirected graphs, bipartite graphs, planar graphs, paths and circuits on a graph.

Learning outcomes

At the end of this learning unit, the student is able to :

Given the learning outcomes of the "Bachelor in Engineering" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes: S1.I1, S1.G1 S2.2 Students who have successfully completed this course will be able to: use the terminology of functions, relationships and together well and perform related operations when the context requires it; explain the basic structure of the main proof techniques (direct proof, counterexample, proof by the absurd, induction, recurrence); apply the various proof techniques in a convincing way by selecting the most adapted to the problem posed; analyze a problem to determine the underlying recurrence relationships; calculate counts, permutations, arrangements on sets as part of an application; modeling various real-world problems encountered in computer science using the appropriate forms of graphs; explain the problem of the shortest path in a graph and apply classical algorithms to solve this problem.

Teaching methods

About 30 hours of lectures, on-site or remotely depending on the situation.
A mandatory project/case study on the implementation and the application of some algorithms.

Evaluation methods

• A mandatory project/case study that counts for 2 to 4 out of 20 points (specified at the beginning of the semester). If the project report is not done (no report submitted), the student will get a 0 for this project. If you failed the project in January, you are allowed to redo and resubmit it for the August session before the first day of the exam session, 23:55. If you do not resubmit the project in August, we take back the January mark (0 if you never submitted the project). No delay is allowed.
• A written exam organized in session counting for 18 to 16 out of 20 points (specified at the beginning of the semester). Organized on-site or remotely, depending on the situation.

Concernant le projet/cas d'étude obligatoire et l'utilisation d'IA de type Chat GPT, assurez-vous que "En soumettant un travail pour évaluation, vous affirmez : (i) qu'il reflète fidèlement le phénomène étudié, et pour cela vous devez avoir vérifié les faits, surtout s'ils sont prétendus par une IA générative (dont vous devez mentionner explicitement l’utilisation en tant qu’outil de soutien à la réalisation de votre travail) ; (ii) avoir respecté toutes les exigences spécifiques du travail qui vous est confié, notamment les exigences pour la transparence et la documentation de la démarche scientifique mise en œuvre. Si l'une de ces affirmations n'est pas vraie, que ce soit intentionnellement ou par négligence, vous êtes en défaut de votre engagement déontologique vis-à-vis de la connaissance produite dans le cadre de votre travail, et éventuellement d’autres aspects de l’intégrité académique, ce qui constitue une faute académique et sera considéré comme tel".

Online resources

On Moodle

Bibliography

Rosen K., Discrete mathematics and its applications, 8th edition, 2019. Mc Graw Hill.

Teaching materials

• Slide du cours
• Textbook "Mathématiques discrètes" de K. Rosen

Faculty or entity

> INFO