CS 391 Algorithms
A detailed study of algorithm design and analysis, including greedy algorithms, divide and conquer, dynamic programming, backtracking, and branch and bound. Some advanced data structures and parallel distributed programming are introduced. There is an emphasis on the verification and analysis of time and space complexity.
Prerequisite
a minimum of 18 semester hours completed in computing science and CS 240 with a minimum grade of C-
Offered
Fall only