1. Accueil
  2. EN
  3. Studying at ULB
  4. Find your course
  5. UE
INFO-F203

Algorithmique 2

academic year
2024-2025

Course teacher(s)

Jean CARDINAL (Coordinator)

ECTS credits

5

Language(s) of instruction

french

Course content

- Algorithm analysis and case study: the Union-find data structure
- Mergesort, Quicksort
- Priority queues and heapsort
- Balanced binary search trees
- Graphs: paths and cycles
- Strongly connected components
- Spanning trees
- Shortest paths
- Dynamic programming
 

Objectives (and/or specific learning outcomes)

On completion of this course, students will be able to conceptualize algorithmic methods and structures, optimize algorithms and data structures, and solve fundamental graph-theoretic problems using appropriate algorithms.

 

Prerequisites and Corequisites

Required and corequired courses

Courses requiring this course

Cours ayant celui-ci comme co-requis

Teaching methods and learning activities

Course, exercises and individual projects.

Contribution to the teaching profile

Learn the theoretical and conceptual foundations as well as the mathematical basis and methodology of computer science (particularly algorithmics).

Contribute effectively to the realization of a moderately complex IT development project.

References, bibliography, and recommended reading

Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne

Other information

Contacts

Jean Cardinal
jean.cardinal@ulb.be

Campus

Plaine

Evaluation

Method(s) of evaluation

  • Other

Other

Written exam with open questions.

Mark calculation method (including weighting of intermediary marks)

25 % homework project, 75 % written exam

Language(s) of evaluation

  • french

Programmes