Emphasis is on developing expertise in the design and analysis of algorithms. Equal importance is given to techniques and to specific algorithms. Particular topics include advanced data structures, graph algorithms, disjoint set manipulation, sorting and selection, amortized analysis, NP-completeness, and matrix and polynomial multiplication.
PREREQ: Undergraduate algorithms and discrete mathematics courses (CISC320 and MATH315).