Catalog Entries |
Fall 2024 Semester
May 12, 2025 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CS 5800 - Algorithms |
|
Presents the mathematical techniques used for the design and analysis of computer algorithms. Focuses on algorithmic design paradigms and techniques for analyzing the correctness, time, and space complexity of algorithms. Topics may include asymptotic notation, recurrences, loop invariants, Hoare triples, sorting and searching, advanced data structures, lower bounds, hashing, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness.
4.000 Credit hours 4.000 Lecture hours Levels: Graduate, CPS - Undergraduate Semester, Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: GSCS Computer & Info Science, NUpath Formal/Quant Reasoning |
|