Discrete structures

linfo1114  2026-2027  Louvain-la-Neuve

Discrete structures
5.00 credits
30.0 h + 15.0 h
Q1
> Schedule
Teacher(s)
Cassiers Gaëtan;
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
The course will consist of:
  • Lectures that will present concepts and tools using examples from computer science;
  • Exercise sessions aimed at systematically applying the various concepts covered in the lectures;
  • Case studies that will allow students to discover certain concepts through problem-solving.
Assignments and mini-projects may also be offered and will not count towards the final course grade.
Evaluation methods
Written exam during the session.
Online resources
On Moodle
Teaching materials
  • Documents sur la page Moodle / Documents on the Moodle page
Faculty or entity
> INFO


Programmes / formations proposant cette unité d'enseignement (UE)

Title of the programme
Sigle
Credits
Prerequisites
Learning outcomes
Bachelor in Computer Science
SINF1BA
5
LINFO1112
Minor in Computer Sciences
MINSINF
5