Here is the schdedule for the Algorithmique course
Sep 14+18: Bertrand, Exercises for Sep 14
Sep 26: Bertrand, exercises for Sep 28
Sep 28 and Oct 2: Harm, exercises for Oct 5
Oct 5 + 9: Raj, exercise for Oct 12
Oct 12 + 16: Luoming, exercises for Oct 19
Oct 19 + 23: Mahdi, exercises for Oct 26
Oct 16 + 30: Masoud, exercises for Nov 2
Nov 2 + 6: Masoud, exercises for Nov 9
Nov 9 + 13: Mahdi, exercises for Nov 16
Nov 16 + 20: Harm, exercises for Nov 23
Nov 23 + 27: Raj, exercises for Nov 30
Nov 30 + Dec 4: Luoming, exercises for Dec 7
Dec 7 + 11: Mahdi, exercises for Dec 14
Dec 14 + 18: Mahdi, no exercises
Note: Since Luoming is not available during the class on Monday, Raj will take care of setting the projector up on those Mondays for which Luoming is responsible. In exchange, Luoming will take care of setting up the projector on the Fridays during which Raj is responsible. The schedule for exercise sheets remains unchanged.
Errata
This is the list of errors in slides and course note that should be corrected.
FastLCS algorithm is not complete (endfor and endif and 2 statements are missing) in trans_en/chap4.tex (page 225 in the pdf file) and trans_fr/chap4.tex. Apparently there is a problem with some definitions.
The constraint for W is missing in the definition of “GREEDY VERSUS DYNAMIC PROGRAMMING: THE KNAPSACK PROBLEM” in trans_en/chap5.tex (page 233 in the pdf file) and trans_fr/chap5.tex.
The proof of correctness of Djkstra's algorithm needs to be added from the course notes to the slides