CS 341 Algorithms

General Information

This course studies the major algorithmic design paradigms and mathematical tools for analyzing the running times of algorithms and detecting computational problems for which no efficient deterministic algorithm. Topics include: basics of analysis of algorithms; general algorithmic paradigms:

divide and conquer
greedy
dynamic programming
graph algorithms
reductions
undecidability

For full syllabus see https://student.cs.uwaterloo.ca/~cs341/