Detailed Course Information |
Fall 2021 - 1st Sem 2021-22
Apr 26, 2024 |
|
 |
||
 | Select the desired Level or 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.
Restrictions: May not be enrolled in one of the following Levels: Undergraduate Level Prerequisites: Undergraduate Level level C S 405 |
| Return to Previous | New Search |
|