CS 447/647 Computer Algorithms
Course Syllabus -- Fall 1997

Instructor: J. Lynch
Office: SC325
Phone: x2374
email: jlynch@polaris or jlynch@sun.mcs

Office hours: MWF 9:30-–11:30

Text: Introduction to Algorithms by T. H. Corman, C. E. Leiserson, and R. L. Rivest

SYLLABUS

We will attempt to cover the following material. Quite likely, some of these topics will be covered lightly or omitted entirely, depending on time and interests of the class.

 CHAPTER TOPIC 1 Introduction 2 Growth of Functions 3 Summations 4 Recurrences 5 Sets, etc. 7 Heapsort 8 Quicksort 9 Sorting in Linear Time 23 Elementary Graph Algorithms 24 Minimum Spanning Trees 34 String Matching 36 NP–Completeness Other Sources Neural Nets, Genetic Algorithms, Verification

If the class size remains small, I would like to base your entire grade on homework.

The homework will consist of exercises, primarily from the text, although other exercises may also be assigned. The homework will be assigned on a weekly basis, except for those weeks when there is a holiday. In determining your final grade, your two lowest homework grades will be dropped, and the remaining ones will be weighted equally.

Homework is the best way for you to learn this subject, and with a small class, it should be possible to run the class this way. I hope this will not be abused. All work in this course should be individual effort. It is perfectly fine (and even encouraged) to discuss the homework problems with me or other students, but the work should be your own. A first time or minor infraction of this policy on a homework assignment will be penalized by a grade of 0 for that assignment. Repeated or flagrant violations will result in a grade of F for the course.