CS2223 - B Term 2005

CS2223 Algorithms

Syllabus— B Term 2005

WARNING: Small changes to this syllabus may be made during the term.

COURSE DESCRIPTION:

CS 2223. ALGORITHMS. Cat. I
Building on a fundamental knowledge of data structures, data abstraction techniques, and mathematical tools, a number of examples of algorithm design and analysis, worst case and average case, will be developed. Topics include greedy algorithms, divide-and-conquer, dynamic programming, heuristics, and probabilistic algorithms. Problems will be drawn from areas such as sorting, graph theory, and string processing. The influence of the computational model on algorithm design will be discussed. Students will be expected to perform analysis on a variety of algorithms. Intended audience: computer science and computer engineering students, and those desiring a deeper understanding of algorithm design and analysis. Undergraduate credit may not be earned both for this course and for CS 507. Recommended background: CS 2102 and CS 2022.

CLASS MEETING:

MT-ThF 2:00 - 2:50 p.m.
FL Auditorium

RECOMMENDED BACKGROUND:

GRADES:

Exam 1	25%
Exam 2	25%
Quiz 1	10%
Quiz 2	10%
Homework	30%
Class Participation	Extra Points

Your final grade will reflect your own work and achievements during the course. Any type of cheating will be penalized in accordance to the Academic Honesty Policy.

Students are expected to read the material assigned to each class in advance and to participate in class. Class participation will be taken into account when deciding students' final grades.

EXAMS and QUIZZES

Exams
There will be a total of 2 exams. Each exam will cover the material presented in class since the beginning of the semester. In particular, the final exam is cumulative.
Quizzes
Two major quizzes will be given during the term. One will be between the beginning of the term and Exam 1, and the other one will be between the Exam 1 and Exam 2. These quizzes will be based on material covered by the homework assignments, the lectures, and/or the textbook, and will serve as preparation for the Exams.

See the Course Schedule for the dates of the exams and quizzes.
Collaboration or other outside assistance on exams and quizzes is not allowed.

HOMEWORK

Several homework assignments will be given. They will be posted to the course webpage at the appropriate times during the term.

The homework will be INDIVIDUAL, unless otherwise noted. You may discuss the material covered by the homework with your classmates if you wish, but you must develop and write YOUR OWN homework solutions. Your solutions must be your own original work.

LATE HOMEWORK POLICY: Unless otherwhise noted, homework is due at the beginning of class at 2:00 pm. Late homework received between 2:01 and 4:30 pm of the day it is due will be accepted with a 30% off penalty. No homework will be accepted after 4:30 pm the day it is due. No exceptions.

CLASS MAILING LIST

The mailing lists for this class are: cs2223-staff ~~AT~~ cs.wpi.edu and cs2223-all ~~AT~~ cs.wpi.edu

Messages sent to cs2223-staff ~~AT~~ cs.wpi.edu reach the professor and the TAs.
Messages sent to cs2223-all ~~AT~~ cs.wpi.edu reach the entire class: professor, TAs, and all the students in the class. This mailing list should be used ONLY for messsages that are of interest to the entire class.

CLASS WEB PAGES

The web pages for this class are located at http://www.cs.wpi.edu/~cs2223/b05/
Announcements will be posted on the web pages and/or the class mailing list, and so you are urged to check your email and the class web pages frequently.

WARNING:

Small changes to this syllabus may be made during the course of the term.

ADDITIONAL REFERENCES

The following additional references complement and/or supplement the material contained in the required textbook.

T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms (Second Edition). MIT Press and McGraw-Hill. 2001.
G. Brassard, P. Bratley. Fundamentals of Algorithmics. Prentice Hall. 1996.
D.C. Kozen. The design and Analysis of Algorithms. Springer-Verlag, 1992.