Course Catalog
Course Catalog
Course Wizard
Course Search
College Wide
- Coll of Advancing&Prof Studies
- College of Education and Human Development
- College of Liberal Arts
- College of Management
- College of Nursing and Health Sciences
- College of Public & Community Service
- College of Science and Mathematics
- McCormack Graduate School of Policy and Global Studies
- School of Global Incl&Soc Dev
GRAD > CS > 624
Analysis of Algorithms
Description:
Basic techniques for designing algorithms: divide and conquer, the greedy method, dynamic programming, etc. Applications to searching and sorting algorithms. Complexity of parsing. The fast Fourier transform and its applications (evaluation of polynomials and arithmetical problems). Lower bound theory. NP-hard and NP-complete problems. Probabilistic estimates of algorithms.
| Section | Class Number | Weekly Schedule | Time | Instructor | Location | |
|---|---|---|---|---|---|---|
| 01 | 2256 | MW | 05:30 PM - 06:45 PM | Offner,Carl D | W01-0004 | More Info |
