CSCI 385 - Advanced Data Structures and Algorithms

This course presents some of the classical algorithm design and analysis techniques. These include an in-depth study of brute force, divide-and-conquer, dynamic programming, and greedy algorithms, as well as an introduction to more advanced techniques such as backtracking, branch-and-bound, iterative improvement, and approximation algorithms. Techniques for parallel algorithms will also be discussed, including divide-and-conquer parallelism, maps, and reductions.

Credits: 3
Terms Offered: As Needed
Prerequisites: CSCI 112 with a grade of C- or better, CSCI 255 with a grade of C- or better