MATH 383 "Algorithms"
Fall 2000

Text:

Computer Algorithms - Introduction to Design & Analysis, Baase & Van Gelder, 2000

Course Goals:
This course is designed to help you

- learn how to analyze algorithms (Big Oh, recurrence relation)

- learn how to design algorithms (divide & conquer, dynamic programming, Greedy)

- gain knowledge of famous algorithms

- gain knowledge of advanced data structures.

Grades:

There will be weekly homeworks (including a final project), two midterms and a final. The evaluation scheme is roughly as follows (I reserve the right to change it):

~10 homeworks (incl. project):	35% total
2 midterms:	30%
1 final:	35%
class participation:	taken into account if necessary.

Policies:

• Students may collaborate with another classmate on programming homeworks unless otherwise directed. The partner's name must be included with the submitted materials. Quizzes and exams must be done independently.
• Stated deadlines for assignments are firm. Late assignments will be penalized.
• No make-up exams. Special arrangements can only be made in case of documented medical emergencies.
• Play by the rules. There are "Academic Integrity Policies and Procedures."

Prerequisites:

Math 172 Computer Science II

Math 215 Discrete Mathematics

Schedule:

We will more or less follow the organization of the book. Chapters 4, 7, 8 and 10 are very important.