C S 388G C S 388G. Algorithms: Techniques and Theory. 3 Hours.
Sorting and searching algorithms, graph algorithms, algorithm design techniques, lower bound theory, fast Fourier transforms, NP-completeness. Three lecture hours a week for one semester. Data Science 388G and Computer Science 388G may not both be counted. Prerequisite: Graduate standing and knowledge of algorithmic paradigms.