- Design and implementation of iterative or recursive algorithms: path, counting, sorting, searching in collections
- Computational complexity
- Basic data structures: arrays, stacks, queues, linked lists
- Recursive data structures: tree structures, binary search trees
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:
Students completing this course successfully will be able to
Students will have developed skills and operational methodology . In particular, they have developed their ability to
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”.
- Magistral courses
- practical sessions
- 2 mini-projects at the end of the semester
- computing server (INGINious) to facilitate self-assessment by students of the solutions they propose to practical works
In the first session, the participation grade takes account of 20% of the final grade + 80% for the final exam (closed book).
The participation mark can not be reassessed.
In the second session, it takes account of 10% and the final exam for 90% of the overall score.
http://moodleucl.uclouvain.be/course/view.php?id=9010 Il n'y a pas d'ouvrage de référence obligatoire mais, à titre complémentaire, des ouvrages sont recommandés sur le site Moodle.