Catalog Description:
Advanced techniques for designing and analyzing algorithms, including asymptotic analysis; data structures; divide-and-conquer algorithms and recurrences; greedy algorithms; dynamic programming; graph algorithms; randomized algorithms; and NP-complete problems.
Last Offered:
Spring 2017
Anticipated Offering(s) - Subject to change:
TBD