COMP 251 — Algorithms and Data Structures

Name: COMP 251 — Algorithms and Data Structures
Rating: 3.07 (2609 reviews)

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. Mathematicaltools: proofs of asymptotic complexity and program correctness, Master theorem.

Rating: 3.07 out of 5 from 2609 student reviews
Difficulty: 4.17 out of 5
Credits: 3
Faculty: Faculty of Science
Department: Computer Science
Taught by: Giulia Alberini
Prerequisites: COMP 250; MATH 235 or MATH 240

Sections offered

Section 001 (Lec), Tue Thu 1:05-2:25 pm — 72 seats open