Algorithm Design and Analysis
Three semester hours.
Introduces formal techniques to support the design and analysis of algorithms focusing on both the underlying mathematical theory and practical considerations of efficiency. Topics include asymptotic complexity bounds, techniques of analysis, algorithmic strategies, and an introduction to automata theory and its application to language translation. Prerequisite: COSC 3301 and MATH 3365.
Home - General Information - Student Services -
Academic Undergraduate Regulations -
Undergraduate Degrees - Academic Graduate Regulations -
Graduate Degrees - Course Descriptions - Faculty -
Appendix A - Appendix B - Appendix C - Appendix D