| |
Jul 12, 2025
|
|
|
|
|
Undergraduate Catalog 2020-2021 [ARCHIVED CATALOG]
|
CSC 260 - Analysis of Algorithms
Prerequisite(s): MAT 124 with a grade of “C-” or better and CSC 150 with a grade of “C-” or better, or permission from the instructor.
This course is a rigorous introduction to the design and analysis of algorithms. Included are discussion of classic problems (e. g. , sorting, traveling, salesman problems), classic algorithm design strategies (e. g. , divide-and-conquer, greedy approaches), and classic algorithms and data structures (e. g. , hash tables, Dijkstra’s algorithm) as well as algorithm complexity, and issues of tractability such as “NP- Completeness. ” Even Spring
Hours: 3
|
|
