22C:31 Algorithms

10:55-12:10 TTh, Room 218 PH

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

Lincoln Lourens		Office hours: Friday 1:30-2:30		Office: B20J, MLH 	Phone: 515 975 4539 (cell) 	E-mail: lincoln-lourens@uiowa.edu
              			      Wed 3:30-4:30

Clifton J. (CJ) Palmer	Office hours: Mon: 1:30-2:30		Office: B20J, MLH 	Phone: 				E-mail: clifton-palmer@uiowa.edu
              			      Tues: 2:15-3:15

Homeworks, Projects, and Exams


Weekly Topics and Links

Online Resources