Design and analysis of efficient, correct algorithms. Advanced data structures, divide and conquer algorithms, recurrences, greedy algorithms, dynamic programming, graph algorithms, search and backtrack, inherently hard and unsolvable problems, approximation and randomized algorithms, and amortized analysis. [Offered: W] Prereq: Level at least 4A Computer Engineering or Electrical Engineering or Software Engineering. Antireq: CS 466, SYDE 423
