EECS 477: Introduction to Algorithms

Fall 2002

Syllabus

Chapter and section numbers below refer to Brassard and Bratley text.

Basic information

Course Material

Prerequisites

Students must have taken EECS 203 (Discrete Structures) and EECS 380(281) (Algorithms and Data Structures), or equivalents. Programming experience in C or C++ is required. Some assignments in this class may require the understanding of C++/STL, but not necessarily designing large programs in C++. If you only know Pascal or Java (or some other language), talk to Prof. Guskov.

Grading

Final grades will be based on the total points earned on the projects and exams. Grading will be on the curve. Factors such as class participation may be used to adjust your final grade, especially if it falls on a borderline. The tentative point breakdown is as follows:

PLASE SEE COURSE WEBPAGE FOR MORE INFORMATION


Copyright © 2002 Igor Guskov