Course Information

This course presents the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their running times. After a brief review of prerequisite material (asymptotics, recurrences, sorting), we will discuss efficient algorithms for basic graph problems (minimum spanning trees, shortest paths, connectivity problem, network flows), solving optimization problems through greedy algorithms and dynamic programming, proofs of intractability and NP-completeness, and approximation algorithms.

For further information, please see the Course Syllabus.

General Information

 
Class Time/Location Tue, Thu 9:30-10:45am
CSI 1121
 
Instructor Dave Mount
Email mount "at" cs
Office AVW 3373
Office Hours To be announced. For now, send me email to arrange a time to meet. Mon and Wed 3:30-4:30pm. Send me email to arrange another time, if needed.
 
Teaching Assistant Tom Dubois
Email tdubois "at" cs
Office AVW 1112
Office Hours Tue 12-1pm and Wed 10-11am. Send him email to arrange another time, if needed.

Recent Annoucements

Check here frequently for important class announcements. A complete list of announcements can be found on the Announcements Page.

Sun, May 11:
The Final Exam is this Friday, May 16, 8-10am in our usualy classroom. The exam is closed-book, closed-notes, but two sheets of notes (front and back) are allowed. Practice problems have been posted to the handouts page.
In addition to my usual office hours (Mon,Wed 3:30-4:40) I'll also have additional office hours Thu, 2-3.
Correction to HW 5: In problems 3 and 4 on Homework 5 I neglected to include the question! In each case, you are to show that the given problem is NP-complete.
Tue, May 6:
Tom will be holding office hours "on demand" for the rest of this week. If you plan to visit office hours, please contact him by email to let him know you will be coming.
Wed, Apr 30:
The course evaluation system is now up and running. To fill out the evaluation, visit www.CourseEvalUM.umd.edu. You log into the site using your directory ID.
Teaching is very important to me, and the evaluations that you fill out are a tremendous help to let me know what you think of the course, and how it can be improved. (Please also fill in written comments, since I find those most informative.) Note that the results are entirely anonymous, and I do not even see the evaluations until after the semester is over and grades have been files.
Wed, Apr 30:
Sorry for the late notice, but due to a meeting across campus, I'll need to miss office hours again. If you would like to meet with me, please send me email.
Tue, Apr 29:
Homework 5 has been handed out. It is dues Tue, May 13 at the start of class. It can be downloaded from the Handouts page.