Catalog Entries |
Fall 2020 - 1st Sem 2020-21
Apr 26, 2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| C S 605 - ANALYSIS OF ALGORITHMS |
|
Techniques for designing efficient algorithms, including choice of data structures, recursion, branch and bound, divide and conquer, and dynamic programming. Complexity analysis of searching, sorting, matrix multiplication, and graph algorithms. Standard NP-complete problems and polynomial transformation techniques.
|
|