Catalog Entries |
Date
Apr 25, 2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CSC 611 - Design&Analysis of Algorithms |
|
This course addresses both the fundamentals and the research boundaries of algorithm design and analysis. Covered topics include: complexity of algorithms, divide and conquer techniques, greedy methods, dynamic programming, recursive backtracking, amortized analysis, graph algorithms, polynomial-time problem reduction, NP-completeness, approximation algorithms and a selected advanced topic. [3-0, 3 cr.]
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture, Tutorial Computer Science & Mathematics Department Course Attributes: MS-INE-Comp.Mod.Data.Anal.Req. |
|