Analysis of Algorithms
This course provides a conceptual framework within which both theoretical and concrete analyses of computer algorithms may be developed. Topics to be covered include: time and space complexity; graph algorithms; problem-solving techniques including divide-and-conquer, greedy algorithms, and dynamic programming; intractability; and approximation.
The syllabus may not be applicable to the current semester. Be sure to verify content with the professor(s) listed in the document.