|
|||
An introduction to the study of the theory and design of algorithms. Topics may include analysis of Abstract Data Types (ADTs), NP-Completeness, study of various graph algorithms, searching and sorting algorithms, and a look at algorithm design techniques such as greedy algorithms, divide and conquer, dynamic programming, and branch-and-bound. Prerequisites & Notes: Prerequisite: CIS 3301. Credits: 3 cr. |
|||
|
|
|||