Computer Science (Sci) : Introduction to algorithm design and analysis. Graph algorithms, greedy algorithms, data structures, dynamic programming, maximum flows.
Terms: Fall 2019, Winter 2020
Instructors: Jérôme Waldispuhl (Fall) Adrian Roshan Vetta (Winter)
Prerequisite: COMP 250
COMP 251 uses basic counting techniques (permutations and combinations) that are covered in MATH 240 and 363, 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.