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.
NOTE: There will be no class on November 19 (Friday).
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
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
Time: January 14, 2011 from 12:15 - 15:15
Venue: Salle Polyvalente and CE6
You are allowed to use an A4-page on which you can write anything on both sides.
Note: You may take a look at your corrected final exams on Feb. 03, 2011 between 10:00 - 12:00 in BC 129.
Note that this is the only time you can contest your exam, since the grades will have been passed to the SAC by Friday, Feb. 04. After that, you can only look at your exam within a period of 6 months, and a time of mutual convenience. *