This page, http://www.cs.uiowa.edu/~hzhang/c231/, is always under construction.
Grades of C- or higher in 22C:031 and 22C:131.
Office: 201B MLH,
Tel: 353 2545
Office hours: TuTh, 2:00-3:00pm, or by appoitment
Thamer Al Sulaiman
Office: 201N MLH,
Office hours: Mon, 1:00-3:00, Fri., 2:00-3:30, or by appoitment
I need to hear from anyone who has a disability, which may require some modification of seating, testing or other class requirements so that appropriate arrangements may be made. Please contact me during my office hours.
Algorithm Design by Kleinberg & Tardos, Publisher Addison Wesley/Pearson, ISBN: 0321295358.
In addition, a number of class notes and handouts will be available through this course web site.
Divide-and-conquer, greed, dynamic programming, reduction.
Recurrences and big Oh, average-case analysis, amortized analysis.
Sorting and searching, integer arithmetic, max flow, string matching, linear programming.
Approximate algorithms, randomized algorithms.
Polynomial reductions, NP-completeness
Students should be prepared to put in considerable time and effort into reading to become familiar with these topics and gain experience with these techniques. At the end of the semester, students should have the knowledge required to identify areas which they would like to investigate in more depth in related courses.
LATE-DUE HOMEWORK ARE NOT ACCEPTED.
There will be one midterm exam (on March 24, 2015, 25 percent) and one final exam (38 percent) in the final week.
Answer keys to the midterm exam
FOR THE POLICY ON CHEATING, SEE THE GRADUATE
HANDBOOK OF THE DEPARTMENT OF COMPUTER SCIENCE.
You are expected to study all the material in each chapter covered in the readings even if that material is not explicitly discussed in class or in the homework. You are also expected to study the extra material presented in class which is not in the textbook. Material presented in class, but not in the book may appear on tests.
The lecture notes are a supplement to the course textbook. They are supposed to help you understand the textbook material better, they are not a replacement for either the textbook or the lecture itself.