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 24th and ends on December 24th, 2010.

You can find the latest polycopies of the course here.

Click here for exercises.

The placement for the exercises is arranged according to the alphabet order of the beginning of your last name as following:

A to B: GCA 331

C to K: GCB 330

L to Z: GCC 330

• 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 : 14:15 - 16:00 - room CE6 (course)
• Mondays : 16:15 - 18:00 - room GCA331, GCB 330 and GCC 330 (exercice)
• Fridays : 13:15 - 15:00 - room CM1 (course)

The videos of the lectures are available from the EPFL video server. Later we will add the slides.

Video Lecutres

Midterm Exam: November 8th during the exercise sessions.

You are allowed to use an A4-page on which you can write anything.

NOTE THAT THE MIDTERM WILL NOT BE GRADED AND HENCE HAS NO EFFECT ON YOUR FINAL GRADE