CS-4321

Introduction to Algorithms

Fall 2001

Quick Info

This class will introduce basic topics in algorithms like asymptotic notation, average and worst-case analysis, solving recurrences, data structures (arrays, lists, graphs, etc), greedy algorithms, divide-and-conquer, dynamics programming, graph algorithms, computational complexity.

We shall use the following text:

``Fundamental of Algorithmics'' by Gilles Brassard and Paul Bratley (Prentice Hall, Englewood Cliffs, New Jersey 07632, 1996, ISBN 0-13-335068-1);

If you have questions, come and see me in 226C Fisher every Tuesday after class. If you cannot make it, please send me e-mail to arrange for a mutual aggreeable time.

For detailed information please consult the syllabus ( PDF).

There will be a midterm exam (30%), a final exam (30%), homework (20%), and class quizzes (20%), each contributing the your final grade with the weight shown in parantheses. Our grader Ping Huo (phuo@mtu.edu) will hold office hours Mondays and Wednesdays, 4-5pm, 214 Dow.

Final Information

The Final exam is Tuesday, December 18th at 7:30 pm in Fisher 138/139. The test will focus on the material we covered after the Midterm.

Office hours for Final preparation:

Friday, Dec.14, 3-5pm, Dow 214 (Ping);
Monday, Dec.17, 3-5pm, Fisher 226C (Sandu);
Tuesday, Dec.18, 3-5pm, Dow 214 (Ping).

Midterm Information

Midterm exam will be on Wednesday October 10, 7-9 pm, ChemSci 102 (this is not our regular classroom, but is near it). The test will cover Chapters 1,2,3, and 4 from the text.

Office hours for Midterm preparation:

Monday, Oct 8, 4-6pm, Dow 214 (Ping);
Tuesday, Oct 9, 3:30-5:30 pm, Fisher 226C (Sandu);
Wednesady, Oct 10, 4-6 pm, Dow 214 (Ping).

Midterm Answers.

Homework

Please check the list of assignments.

Grades

You can check your standing.

asandu@mtu.edu (Adrian Sandu)
http://www.cs.mtu.edu/~asandu/Courses/CS4321/CS4321.html