Course Description( 3 credits )
An introduction to algorithms
analysis and design with focus on using both mathematical tools and
object-oriented design. Topics include asymptotic complexity bounds, techniques
of analysis, and algorithmic strategies using object-oriented programming
language such as Java or C++. Emphasis on recursion, search, storing, and graph
and tree algorithms, and on implementation and application of various
algorithmic strategies.
Prerequisite : MA310 Discrete Mathematics and CS250 Data Structures and Abstraction.
Previously Taught :
Instructor :
Dr Mihaela Sabin
|