CS447/547 COMPUTER ALGORITHMS
FALL   2007


Lecturer: James F. Lynch
Office: SC-381
Telephone: 268-2374
email: jlynch@clarkson.edu
Office hours: MWF 11:00AM–12:00PM, MW 1:30PM–2:30PM
Lecture hours: MWF 10:00AM–10:50AM, SN-169
Text: Introduction to Algorithms, 2nd Edition,
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
ISBN: 0-262-032937


GRADING

If enrollment remains small, then I want to base the grading on homework and class participation. This will consist of: written exercises and discussions, primarily on problems from the text.

 

Students may work on the assignments as individuals or in teams of two.  While it is permitted (and actually encouraged) to discuss the homework with students outside your team, I expect to see originality in what each team turns in.  If this approach does not work, and I see violations of this policy, I will revert to the usual approach of in-class exams and a final.


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&2

Introduction and Background

3

Growth of Functions

A

Summations

4

Recurrences

5

Probabilistic Analysis

6

Heapsort

7

Quicksort

8

Sorting in Linear Time

11

Hash Tables

22

Elementary Graph Algorithms

23

Minimum Spanning Trees

24

String Matching

34

NP-Completeness


HOMEWORK ASSIGNMENTS

Problems for class September 3
Homework Assignment 1 (due September 10)