Informatique (Sci) : Introduction to algorithm design and analysis. Graph algorithms, greedy algorithms, data structures, dynamic programming, maximum flows.
Terms: Automne 2023, Hiver 2024
Instructors: Alberini, Giulia; Waldispuhl, Jérôme (Fall) Becerra, David (Winter)
Prerequisites: COMP 250; MATH 235 or MATH 240
COMP 251 uses mathematical proof techniques that are taught in the corequisite course(s). If possible, students should take the corequisite course prior to COMP 251.
COMP 251 uses basic counting techniques (permutations and combinations) that are covered in MATH 240 but not in MATH 235. These techniques will be reviewed for the benefit of MATH 235 students.
Restrictions: Not open to students who have taken or are taking COMP 252.