Course Information:

• Course Outline: The course is intended as a first graduate course in the design and analysis of algorithms. The main focus is on developing an understanding for the major algorithm design techniques. At times, the practical side of algorithm design is also explored with interesting examples of their usage in solving industry problems.

• Text:
  The textbook is
  * Algorithm Design
          Jon Kleinberg/Eva Tardos
  The class will be relying mostly on the textbook, but additional material will occasionally be drawn from the following:
  * Introduction to Algorithms (second Edition)
          Thomas H Cormen, Charles E. Leiserson, Ronald L. Rivest and Cliff Stein published by MIT Press and McGraw-Hill.

Students in the class are expected to have a reasonable degree of mathematical sophistication, and to be familiar with the basic notions of algorithms and data structures, discrete mathematics, and probability. Undergraduate classes in these subjects should be sufficient. If you have doubts about meeting these prerequisites, please contact the instructor.

Class Structure:

• Homework: There will be about 7 to 12 homework assignments.
• Exams: There will be two in-class midterm exam and a final exam.

Syllabus

This syllabus is meant as an outline. Depending on progress, material may be added or removed. Also, there will often be interesting tangents to follow.

* Introduction and overview
* Complexity of algorithms--review
* Basic graph algorithms--review
* Greedy Algorithms
* Data structures
* Graph algorithms
* Dynamic Programming
* Divide-and-Conquer
* Amortized analysis
* Max-Flow/Min-Cut and its applications
* P, NP, and NP-Completeness
* Approximation methods, linear programming

Exam Schedule

Grading

There will be two midterm and one final exam in this course. Each midterm exam worth 30% and the final 40%. There will be homework assigned from the textbook roughly every 1-2 weeks. The homework will be collected and graded but Will NOT be accounted in your grade; Solutions to the homework will become available shortly after the deadline.

Homework is due at the start of class on the due date. There will be roughly 7-12  homework assignments.

Additional policies:

• Academic Integrity Policies of the University will be strictly enforced. You are encouraged to review these policies, for example in SCampus.
• Please visit course homepage and check Announcements regularly.
• No late homework will be accepted unless approval is granted from the instructor in advance.

Last Update : Monday, November 24, 2008 @ 3:29:10 PM