Module
UCLA CS 180-Style Algorithms and Complexity
Sign in to add this module to your path and practice.
About
A focused undergraduate path matching UCLA CS 180 (and Kleinberg–Tardos Algorithm Design): asymptotic analysis, graph algorithms, divide-and-conquer, greedy methods, dynamic programming, and NP-completeness. Builds algorithmic thinking for junior/senior CS majors who already have discrete math plus intermediate programming/data structures (CS 32/33/35L equivalent).
Goal
Independently design, correctly implement (in pseudocode), prove correctness of, and asymptotically analyze algorithms using the major paradigms; reduce problems to establish NP-completeness; and solve representative problems at the level of a standard CS 180 final exam or Kleinberg–Tardos chapters 1–6 + 8.
Prerequisites
Tutor
Ask questions about this module.
Hi — I'm your tutor for UCLA CS 180-Style Algorithms and Complexity. Ask about the concepts, goal, or where you're stuck.