22C:31 Algorithms

1:05-2:20 TTh, Room 109 EPB

Instructor: Sriram V. Pemmaraju
101G MLH, sriram@cs.uiowa.edu, 319-353-2956
Office Hours: MW 9-10:30 am

This course deals with the design and analysis of algorithms. We will study algorithm design techniques such as greedy method, dynamic programming, divide-and-conquer, and randomization and see many examples of each of these techniques in action. We will study algorithm analysis techniques such as asymptotic analysis, recurrence relations, and charging schemes. Towards the end of the course, we will also study the intractability of problems, specifically the theory of NP-completeness. Time permitting, we will study approximation algorithms as a way of getting around the intractability of some problems.

Syllabus document, Information about TAs, Announcements, Quizzes, Projects, and Exams, Weekly Topics, Online Resources

(From xkcd)

Information about TAs

There is one Teaching Assistant (TA) assigned to this course, Lu Bi, a Ph.D. student in computer science. She will be the primary grader for the course. Her contact details and office hours are as follows:
office		e-mail		office phone	office hours
201C MLH        lu-bi@uiowa.edu 319 353 2546 	M 3:30-5:00, F 10-11:30

Quizzes, Projects, and Exams


Weekly Topics and Links

Online Resources