Click here for the course material and exercise sheets.

Examen Final

L'examen final aura lieu le 17 Juillet 2007 a 8h15 dans la salle SG1. Le seul document autorisé est une feuille A4 recto verso de notes. Les calculatrices et téléphones portables sont interdits. The polycopies of the Algorithmique course are available at the “Librairie La Fontaine” for the price of CHF 21.20.

In this course you will get familiar with the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, the design of algorithms by induction, Sorting and searching, Merge sort, quicksort, heapsort, binary search, graph algorithms and data structures, graph traversals, shortest paths, spanning trees, matching, network flows, and elements of the theory of NP-completeness.

This is a course for second year students of both the systèmes de communication and informatique sections. The main classes will be in english, while the exercise classes and course material will be in french.

  • The course notes.
  • Udi Manber: Introduction to algorithms: A creative approach. (Addison Wesley publishing, 1989)
  • Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein: Introduction to algorithms. (MIT Press, 2001)


  • Tuesdays 9h15-11h00 at CM2 (lecture)
  • Fridays 8h15-10h00 at CE6 (lecture)
  • Fridays 10h15-12h00 at CE6 (exercises)