CS570: Analysis of Algorithms (Spring 2009)
Most recent message posted:
05/15/2009
- Class meets Tuesdays and Thursdays from 9:30-10:50pm, in room KAP
158.
- Instructor and Teaching Assistants:
| Instructor |
Teaching Assistant |
| Name |
David Kempe |
Po-An Chen |
| Office |
SAL 232 |
SAL 237 |
| Office Hours |
Wednesday, 10:30-12:00 or by appointment |
Monday/Thursday, 2:30-4:00 |
| Phone |
(213)-740-6438 |
(213)-740-6747 |
| e-mail |
 |
 |
- There will be a quiz on the prerequisites on Thursday, 01/15, in
class.
- There will be two takehome midterms. One will be mid to late
February, the other one late in March.
- The final exam will also be takehome, and cumulative.
- There will not be any in-class exams or quizzes beyond the
prerequisite quiz.
- There are parallel sessions, taught by
Dr. Shawn Shamsian and Prof. Ming-Deh Huang. These sessions will be significantly
different from this one. The material covered in the session
taught by Prof. Kempe will be more advanced, and strictly assume
knowledge of the prerequisites. Dr. Shamsian's and Prof. Huang's
sessions will place more emphasis on a review of the basic
material, and will be altogether easier. Computer science
Ph.D. students are required to enroll in Prof. Kempe's
section. Master's students and Ph.D. students from other
departments have a choice of which session to enroll in.
Course Overview, Syllabus, Textbook, Prerequisites
The course is intended as a first graduate course in the design and
analysis of algorithms. While the main focus is on known and
well-established results in the literature, there will be many
times when the course will touch on uncharted territory, or
suggest directions for research. The course will give an overview
of common techniques, and applications of these techniques in
different settings. Look also at the more detailed
syllabus.
The textbook is
- Jon Kleinberg/Éva Tardos: Algorithm Design.
The book will be available at the campus store.
The class will be relying mostly on the textbook, but additional
material will occasionally be drawn from the following books
(which will be placed on reserve, as is a copy of the textbook):
- Cormen/Leiserson/Rivest/Stein: Introduction to Algorithms (2nd edition)
- Dasgupta/Papadimitriou/Vazirani: Algorithms
- Garey/Johnson: Computers and Intractability
- Motwani/Raghavan: Randomized Algorithms
- Vazirani: Approximation Algorithms
- Borodin/El-Yaniv: Online Algorithms
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. Specifically, the following will be assumed:
- Mathematical Proofs, in particular induction and contradiction.
- Big-Oh notation (Big-O, Omega, Theta), how to apply them.
- Basic data structures: arrays, linked lists, trees, balanced
trees, heaps (priority queues), graphs.
- Basic graph algorithms: connected components, BFS, DFS.
- Other algorithms: binary search, sorting.
- Discrete mathematics: evaluating sums and simple recurrences.
Undergraduate classes in these subjects should
be sufficient. If you have doubts about meeting these
prerequisites, please contact the instructor. Notice that these
prerequisites will actually be verified with a quiz during the
first week of classes.
Information about Homework and Grading
is on a separate page.
Academic Integrity, Collaboration
All students are expected to maintain the utmost level of academic
integrity. Passing off anyone else's (whether it be a fellow
student or someone outside the university) work as your own is a
serious infraction, and will lead to appropriate
sanctions. Similarly, any collaboration during exams is
prohibited. Please consult the USC
Student Conduct Code
(general overview) for details on what is and
is not appropriate, and for the possible consequences of
infractions.
However, as research is usually a joint effort, students are
encouraged to collaborate on general solution strategies for
homework. The writeup, however, must be your own - you may not
copy someone else's solution. In addition, your homework should
list all the fellow students with whom you discussed the
solutions. Collaboration is restricted to fellow students inside
the class; collaboration with students outside the class or others
(such as discussion groups on the WWW) are not appropriate, and
will lead to appropriate sanctions.
On takehome exams, any collaboration with classmates is strictly
prohibited. The only acceptable behaviors are solving the exam
yourself (using your class notes and the textbook), or asking
the TA and instructor for help.
- 05/15/2009: The weighted averages and course grades have been posted on
the Blackboard site.
The overall grade distribution was: 1*A+, 7*A, 3*A-, 2*B+, 1*B, 2*B-, 1*C.
These grades are final, and will only be changed if I made a severe
error (such as mis-entering a grade, or adding
incorrectly). At this point, it is too late for regrades.
Have a great summer, everyone!
- 05/14/2009: Hardcopies of a sample solution for the final are now
available outside David's office door.
- 05/14/2009: The grades for the final exam have been posted on
the Blackboard site.
The maximum score (out of 60 possible) was 52, and the minimum 15, with an
average of 38.7.
- 05/09/2009: David will hold additional office hours on Monday
(05/11) from 1:45-3:00.
- 05/08/2009: The grades for the seventh homework have been posted on
the Blackboard site.
The maximum score (out of 40 possible) was 40, and the minimum 17, with an
average of 33.9. I enjoyed reading your answers to Question 1, but
decided there was no way I could assign grades to them.
- 05/06/2009: David will hold additional office hours on Friday
(05/08) from 2:00-3:30.
- 05/06/2009: The grades for the sixth homework have been posted on
the Blackboard site.
The maximum score (out of 40 possible) was 39, and the minimum 21, with an
average of 32.9.
- 04/30/2009: Po-An's office hours next Thursday (05/07) will be from
10:30-12:00 instead of at the usual time.
- 04/30/2009: The handout on
randomized rounding has been posted.
- 04/29/2009: The final exam has been posted. It
is due in David's office no later than noon on Tuesday, 05/12/2009.
- 04/28/2009: The grades for the fifth homework have been posted on
the Blackboard site.
The maximum score (out of 40 possible) was 40, and the minimum 21, with an
average of 32.8.
- 04/22/2009: The seventh homework
assignment has been posted. It is due in class by 04/30/2009, and
cannot be submitted late.
- 04/22/2009: The handout on online
algorithms has been posted.
- 04/17/2009: The sixth homework
assignment has been updated to fix a mistake.
- 04/16/2009: The sixth homework
assignment has been posted. It is due in class by 04/23/2009.
- 04/14/2009: The grades for the fourth homework have been posted on
the Blackboard site.
The maximum score (out of 40 possible) was 40, and the minimum 14, with an
average of 31.35.
- 04/09/2009: The grading scale has been revised to reflect the fact
that there will only be one midterm.
- 04/07/2009: The fifth homework
assignment has been posted. It is due in class by 04/14/2009.
- 03/24/2009: Due to David's travel, the office hours on Wednesday,
03/25, will be cancelled.
- 03/24/2009: Due to David's travel, Thursday's lecture will be
given by Prof. Ming-Deh Huang.
- 03/23/2009: The fourth homework
assignment has been posted. It is due in class by 03/31/2009.
- 03/23/2009: The grades for the first midterm have been posted on the
Blackboard site. The maximum score
(out of 40 possible) was 38, and the minimum 16, with an average of about
29.9.
- 03/23/2009: The grades for the third homework have been posted (a
while ago) on the Blackboard site.
The maximum score (out of 40 possible) was 40, and the minimum 12, with an
average of 30.
- 03/05/2009: The grades for the second homework have been posted on the Blackboard site. The maximum score
(out of 50 possible) was 50, and the minimum 16, with an average of about
37.7.
- 03/04/2009: The first midterm has been
posted. It is due in David's office by 12:00 noon on
Friday, 03/13/2009.
- 02/25/2009: The third homework
assignment has been posted. It is due in class by 03/05/2009.
- 02/24/2009: I posted a handout on the
Edmonds-Karp Max-Flow Algorithm.
- 02/17/2009: The grades for the first homework have been posted on the Blackboard site. The maximum score
(out of 40 possible) was 38, and the minimum 8, with an average of about
26.2.
- 02/11/2009: The second homework
assignment has been posted. It is due in class by 02/19/2009.
- 01/25/2009: The first homework
assignment has been posted. It is due in class by 02/03/2009.
- 01/21/2009: I posted a handout on Fibonacci
Heaps, which we will cover in class next week.
- 01/21/2009: Note the updated information on exams. All of the
course's exams will be takehome this semester.
- 01/20/2009: This week's Wednesday office hours will be a few minutes
later than usual, from around 10:45-12:15 (I might be running yet a few
minutes later than that.)
- 01/19/2009: The grades for the quiz have been posted on the Blackboard site. The maximum score
(out of 51 possible) was 44, and the minimum 16, with an average of about
33.24.
- 01/13/2009: David's office hours this week will be on Wednesday from 9:30-11:00
instead of the usual time.
- 12/09/2008: There will be a quiz on the prerequisite material
on Thursday, January 15.
- 12/09/2008: This is the place where you will find all of your
important updates about class. Check back frequently.