Teacher(s)
Language
French
Prerequisites
This course assumes the mastery of programming and program design in an object-oriented language such as Java, knowledge of elementary data structures and notions of recursion and computational complexity as targeted by the course LEPL1402.
The prerequisites for this teaching unit (UE) are specified at the end of this sheet, next to the programs/training courses that offer this teaching unit.
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 prerequisites for this teaching unit (UE) are specified at the end of this sheet, next to the programs/training courses that offer this teaching unit.
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
- Complexity measures of an algorithm and complexity analysis methods.
- Dichotomic sorting and search algorithms.
- Basic data structures (lists, trees, binary search trees): study of their abstract properties, their concrete representations, their application and the main algorithms that manipulate them.
- Advanced data structures (union-find, hash tables, heaps, balanced binary trees, graph representation and manipulation, textual data processing, dictionaries).
Learning outcomes
At the end of this learning unit, the student is able to : | |
With regard to the AA reference framework of the “Bachelor in Civil Engineering” program, this course contributes to the development, acquisition, and assessment of the following learning outcomes:
With regard to the AA reference framework of the “Bachelor in Computer Science” program, this course contributes to the development, acquisition, and assessment of the following learning outcomes:
Students who successfully complete this course will be able to:
Students will have developed methodological and operational skills. In particular, they will have strengthened their ability to:
|
|
Content
- Computational complexity,
- Sorting,
- Trees, binary search trees,
- Balanced trees,
- Tries,
- 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 reverse classes. There are six two-week modules. Each module includes an introductory course to the subject, theoretical exercises to prepare, chapters from the reference book to read, a practical work on correcting exercises in the middle of the model, work on inginious to be carried out (Java programs) and finally a restructuring course at the end of the module. One of the essential components of this pedagogy consists in making each student learn by himself. The success of the learning process therefore presupposes a significant involvement of each student. The actual learning remains the responsibility of each student. To pass the exam it is imperative that the student programs regularly.
Evaluation methods
Computer-based exam using INGInious: https://inginious.info.ucl.ac.be
Generative AI tools may not be used during the individual exam. No collaboration or communication is allowed during the exam. The exam questions are written in English.
An algorithmic competition will be organized. Active participation in the competition, corresponding to successfully solving at least one question, will earn you 1 additional point on the exam. In this case, the exam will be graded out of 19 instead of 20, and the point earned in the competition will be added to this grade.
Participation in the competition is optional: not participating will not penalize you.
Generative AI tools may not be used during the individual exam. No collaboration or communication is allowed during the exam. The exam questions are written in English.
An algorithmic competition will be organized. Active participation in the competition, corresponding to successfully solving at least one question, will earn you 1 additional point on the exam. In this case, the exam will be graded out of 19 instead of 20, and the point earned in the competition will be added to this grade.
Participation in the competition is optional: not participating will not penalize you.
Other information
Online resources
https://moodle.uclouvain.be/course/view.php?id=1049 (mainly for communications with students)
https://pschaus.github.io/LINFO1121/ (main website, with the exercices to do each week)
https://pschaus.github.io/LINFO1121/ (main website, with the exercices to do each week)
Bibliography
Livre obligatoire:
Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne, Addison-Wesley Professional.
ISBN-13: 978-0321573513
ISBN-10: 032157351X
Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne, Addison-Wesley Professional.
ISBN-13: 978-0321573513
ISBN-10: 032157351X
Faculty or entity
Programmes / formations proposant cette unité d'enseignement (UE)
Title of the programme
Sigle
Credits
Prerequisites
Learning outcomes
Specialization track in Computer Science
Approfondissement en statistique et sciences des données
Mineure Polytechnique