Topics in algorithms
computer science
about this course
This 2-credit elective course bridges the gap between classic polynomial-time algorithms (COMP210) and advanced problem-solving paradigms required for computationally intensive optimization challenges of importance in the real-world.
The course introduces the notion of NP-completeness and then introduces paradigms for tackling NP-hard problems. The course focuses on foundational algorithmic problems such as Network Flows and Vertex Cover across multiple frameworks to give a cohesive understanding of how an algorithmic strategy shifts
depending on the computational constraints and desired solution accuracy.
in these programmes
- computer science
elective · 4-year major, 4-year double major, 3-year major, 3-year double major, 4-year minor, 3-year minor
planning & teaching
before this
recently taught by
- Mithilesh KumarSenior Lecturer, Computer Science
Recorded in 2026 T1. Instructors may change.