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, divideandconquer,
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:
MTThF 1:00  1:50 p.m.
FL Auditorium
PROFESSOR:
Prof. Carolina Ruiz
Office: FL 232
Phone Number: (508) 8315640
Office Hours: FL 232
GRADUATE TEACHING ASSISTANTS:
TEXTBOOK:
RECOMMENDED BACKGROUND:
Recommended background:
CS
2102 and
CS
2022.
GRADES:
Exam 1  25%

Exam 2  25%

Exam 3  25%

Homework  25%

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 3 exams. Each exam will cover the
material presented in class since the beginning of the term.
In particular, the final exam is cumulative.
The exams will be based on material covered by the homework
assignments, the lectures, and/or the textbook.
Quizzes
Pop quizzes may be given during the term.
See the Course Schedule for the
dates of the exams.
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 1:00 pm.
No homework will be received during the class period (1:011:50 pm).
Late homework received between 1:51 pm and 4:30 pm of the day it is due
will be accepted with a 30% off penalty (submit late homework in the
CS Department Office FL233).
No homework will be accepted after 4:30 pm the day it is due.
No exceptions.
CLASS MAILING LIST
There are two mailing lists for this class (replace XXXX with 2223 below):
This mailing list CSXXXXall that reaches the whole class 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/d09/
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 & RESOURCES