Text: McConnell, Analysis of Algorithms: An Active Learning Approach, 2nd Edition

Class web page: http://phoenix.goucher.edu/~jillz/cs230

Course Description and Goals:
We will study how to analyze the efficiency of algorithms and thereby learn how to design efficient algorithms.  Classic algorithms involving searching, sorting, and graph theory, as well as other areas will be examined.

Course Objectives:

• Learn asymptotic analysis  for measuring programming resources
• Learn classic searching, sorting, and graph algorithms and be able to implement and analyze them
• Extrapolate and apply knowledge to new situations
• Write clear and logical arguments to mathematical problems
• Write clear, well documented code.

Course Mechanics
Some group work will be performed in class.  Work that is assigned for outside of class must be done individually. (See honor code for definition of cheating and disposition.)  All written homework must be turned in on time.  No written homework will be accepted late.  Programming assignments will be accepted one weekday late with a 25% penalty.

Grading
2 Exams (20% each) 40%
Comprehensive Final 25%
Homework/Projects 35%