CS 320 Design Patterns and Algorithms
This course provides an introduction to mathematical modeling of computational problems and an introduction to algorithm design through a survey of the common algorithm design paradigms of greedy optimization, divide and conquer, dynamic programming, network flows, reductions, and randomized algorithms. The course emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems. Prerequisites:
CS-222 and
MAT-205.
Prerequisite
CS 222 and MAT 205
Offered
Fall Term