COMP 251 Algorithms and Data Structures

3 credits · Computer Science · Faculty of Science · Offered: Fall, Winter

Data Structures: priority queues, balanced binary search trees, hash tables, graphs. Algorithms: topological sort, connected components, shortest paths, minimum spanning trees, bipartite matching, network flows. Algorithm design: greedy, divide and conquer, dynamic programming, randomization. Mathem…

Prerequisites

COMP 250; MATH 235 or MATH 240 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.

Prerequisite courses: COMP 250, MATH 235, MATH 240

Restrictions

Not open to students who have taken or are taking: COMP 252 or COMP 260.

Courses that need COMP 251

Plan your whole degree in myDegree. Fit COMP 251 and everything it needs into a plan, term by term. Open myDegree

Source: McGill Course Catalogue. myDegree is an independent student project, not affiliated with McGill University.