|Title||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.
|Credits||3 - credits|