Algorithmics and data structures

LSINF1121  2020-2021  Louvain-la-Neuve

Algorithmics and data structures
The version you’re consulting is not final. This course description may change. The final version will be published on 1st June.
5.0 credits
30.0 h + 30.0 h

  • Computational complexity,
  • Trees, binary search trees,
  • Balanced trees,
  • Dictionaries and hash tables,
  • Priority queues and heaps
  • Graphs,
  • Text processing (pattern matching, compression algorithms)
Teaching methods

The active pedagogy method followed in this course is inspired by flipped classrooms. There are six two-week modules. Each module includes an introductory course on the subject, theoretical exercises to prepare, chapters of the reference book to read, a session to correct exercises in the middle of the model with the TA, work on inginious to realize (Java programs) and finally a restructuring course at the end of the module. One of the essential components of this pedagogy is self-learning. The success of the learning process thus presupposes a significant involvement of each student. The actual learning remains the responsibility of each student. To pass the exam it is highly recommended that the student programs regularly.

Evaluation methods

Examen on computer using Inginious

A mi-term quizz could be organized during the smart-week but will effectively count in the final grade only if it is favorable.


Required Textbook:
Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne, Addison-Wesley Professional.
ISBN-13: 978-0321573513
ISBN-10: 032157351X

Exercices and documents

Communication with students using moodle


Faculty or entity

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

Program title
Minor in Engineering Sciences: Computer Sciences (only available for reenrolment)