CS A411: Design and Analysis of Algorithms, Complexity

Course Syllabus, Spring 2002 Textbook

Course Description: Techniques for the design and analysis of algorithms. Problem Solving. Case studies of existing algorithms (sorting, searching, graph algorithms, dynamic programming, string matching). NP-completeness. The goal is to develop a group of useful algorithms which can be used to solve common problems. The development of tools and principles for analyzing the correctness, time, and space used by these algorithms.

Homework Assignments:    Due by the beginning of class unless otherwise noted.  There will be approximately six analytical homework assignments and two programming exercises. Late homework will be penalized by 10% per day late, up to the day that answers are provided. We will typically go over answers the next week (but not always). Unless otherwise indicated, programming assignments and written assignments must represent your own work. It is permissible to discuss the assignments with other students, but do not disclose the solution.

Questions: If you have any questions, feel free to come in to my office.  In general, I have an open door policy -- if I am available in my office, you are welcome to come by.  An even better way to reach me is through email.  I check my email frequently and you should receive a response quickly.  Email is preferred over telephone and you will probably receive a faster response since I don't check voicemail very frequently.  You can also contact me online via ICQ, AIM, or MSN Messenger (see contact info on the home page).  I'm often up late and will be glad to answer questions if I'm available! 

Exams: Including the final, there will be three exams.  The midterm will cover several chapters of the books while the final exam may include any material that was covered in the course, but will emphasize the new material. Unless prior arrangements are made no make-up exams will be given. Since you will be tested upon your critical thinking and problem solving skills and not your ability to memorize formula, you may use one sheet of notes (both sides) for each exam. Otherwise, the exams will be closed book. Cheating on assignments and exams will not be tolerated.

Grading:  Exams will be graded and returned to you. Grades will be posted according to randomly assigned numbers on the web site throughout the semester.

Grading breakdown:

Homeworks:  25%   (all homeworks are worth an equal amount)
Program 1:     6%
Program 2:     9%
Exam 1:         18%
Exam 2:         18%
Final:              24%

The grade scale is shown in the table below.  The grading curve may be lowered if necessary but it will not be raised.  This means that if you received an 89% then you will at least get a B+, but may receive a higher grade based on the curve.  (Final grades don't include a + or -).

An incomplete grade will only be given for a valid excuse (e.g. medical, death in the family). An incomplete grade does not let you take the class over again, your final grade will be assigned based on work submitted in class and work that remains to be submitted.

Cheating: Students are expected to uphold the UAA standard of conduct relating to academic dishonesty outlined in the UAA catalog and student handbook.  Cheating is not tolerated and constitutes grounds for dismissal.  For this class, it is permissible and encouraged to assist classmates in general discussions of how to attack the homework problems. It is not permissible to copy another's work (or portions of it) and represent it as your own.