CS 515 - Algorithms and Data Structures
Fall 2006


Overview

CS 515 is a graduate-level introduction to algorithms, data structures, and computational complexity.

Exams

There will be two exams

Midterm Exam: TBA
Final Exam: TBA

Homework

The homework in this course will consist of written problem assignments. There will be no programming. Homework is due at the beginning of class on the due date. Late homework will be discounted at a rate of 10% per day for a maximum of 5 days upon which no credit will be given for the assignment.

Grades

The final grade will be based on the following break down: Homework 50%, Midterm 20%, Final 30%

Regrade Policy

Any requests for regrading of homework or exams must be given to the TA (for homework) or instructor (for exams) in writing accompanied by the homework/exam. Such requests must be made within one week after the exam/homework has been returned. Only submit requests when you observe what appears to be a clear error in the grading. Do not abuse this avenue.

Honor Code

All exams are closed book and closed notes. Anyone caught cheating on an exam will automatically fail the course.

Collaboration on homework problems is permitted; copying of solutions is not. The work you hand in should be your own. While some students find studying together to be quite beneficial and enjoyable, I strongly encourage you to attempt to solve homework problems on your own, as this is the only way to ensure that you have mastered the material. Generating solutions, as must be done on an exam, is much different and more difficult task than verifying solutions of a friend. The bottom line is that if you are copying homework then you will likely perform poorly on tests.