|
|
Apr 23, 2024
|
|
C S 572 - Design and Analysis of Algorithms3 Credits
Design methodologies: divide-and-conquer, exhaustive search, dynamic programming. Time and space complexity measures, analysis of algorithms. Survey of important algorithms for searching, sorting, graph manipulation. Tractability: class P and NP, NP-complete problems.Prerequisites: C S 145 and MATH 215 Meets with C S 472
Add to Portfolio (opens a new window)
|
|
|