Click here for the course material and exercise sheets.

The final exam is to take place on 21.01.2008, from 14h15 to 17h30 in two rooms, CO2 and CO3. You are allowed to take a two-sided A4 sheet with you, but no other documents nor calculators will be allowed.

Due to popular demand, you can find the polycopies of the course here.

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 starts on September 18 and ends on December 21.

  • 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)


  • Mondays 16h15-18h00 at CM2 (lecture)
  • Fridays 13h15-15h00 at CM1 (lecture)
  • Fridays 15h15-17h00 at CM4 (exercices)

Office hours:

  • Prof. A. Shokrollahi: Wednesdays, 10:15 - 11:15, BC 110.
  • M. Cheraghchi: Fridays, 9:00 - 11:00, BC 148
  • Dr. L. Minder: Tuesdays, 9:00 - 11:00, BC 150
  • B. Ndzana Ndzana: Tuesdays, 16:00 - 18:00, BC 148