COSC 302 - Analysis of Algorithms
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.
Corequisite: COSC 302L
Prerequisites: COSC 290
Major/Minor Restrictions: None
Class Restriction: None
Recommended: Previous completion of COSC 290 is strongly recommended.
Area of Inquiry: Natural Sciences & Mathematics
Liberal Arts CORE: None
Click here for Course Offerings by term