Covers advanced data structures, computational geometry, cryptography, dynamic programming, greedy algorithms, divide-and-conquer, graph algorithms (e.g., depth-first search), network algorithms (e.g., shortest paths), approximation algorithms. Prerequisites: Requires prerequisite courses of APPM 1360 or MATH 2300 and one of the following: CSCI 2824, ECEN 2703, APPM 3170 or MATH 2001 (all minimum grade C-).
