COSC 312 Design and Analysis of Algorithms
This course presents the key algorithmic strategies and solution methodologies, irrespective of programming language or hardware platform. It delves into Big-O notation, analysis of worst and average cases, handling recurrences, and asymptotic behavior. The student will explore efficient sorting, searching, and selection algorithms. Additionally, the course delves into algorithm design techniques, addressing fundamental graph problems, string manipulation algorithms, and numerical methods.
Prerequisite
COSC301,( COSC310, or ECCE342)
Distribution
2-2-3Offered
Spring