CMSC 37000: Algorithms -- Winter 2007


What's new | Course info | Text | Grading, test dates | Policy on collaboration | Homework | Tests | Handouts | Stat |



What's new?

Final exam Thursday, March 15, 8:00 - 10:00 am, Ry 251.

Pre-final office hours will be held by the instructor Monday, March 12, 4-6pm, and Wednesday, March 14, 3:30-5pm.
Meet at the instructor's office, Ry 164.

If the departmental email server is down, you may use lbabai[at]gmail[dot]com to contact the instructor.

Complete test statistics posted (Midterm and Quizzes 1--5: 45%). (Click "Stat" on the banner.)

Complete HW statistics posted (HW 1--15: 20%) (Click "Stat" on the banner.)

Class participation statistics posted (5%) (Click "Stat" on the banner.)

All but final statistics posted (CP, HW, MT, quizzes: 70%) (Click "Stat" on the banner.)

Quiz-5 posted. (Click "Tests" on the banner.)


Old news

Tutorials are held each Wednesday, 3:30 pm - 4:20 pm, in Ry-276.
Tutorials are mandatory unless waived by the instructor. Attendance will count toward the "class participation" component of the grade.

The TAs hold an office hour every Monday 5 to 6pm. Meet at Ry 165A. Take advantage of this opportunity; bring your own questions.

The handouts include solutions to dynamic programming problems. Past tests from this class, along with some tests from previous years, are available.

Quiz and homework statistics posted. (Click "Stat" on the banner.) Compare the HW statistics with the green numbers on your graded homework.

A request to all who attend this class. Please introduce yourself to the instructor by email. Include the following information:

Go to top


Course information

Instructor: László Babai     Ryerson 164     e-mail: laci(at)cs(dot)uchicago(dot)edu.

Office hours: by appointment (please send e-mail)


Teaching assistants:

Sourav Chakraborthy           Ryerson 162A     e-mail: sourav(at)cs(dot)uchicago(dot)edu.

Ozgur Sumer     Ryerson 165A    e-mail: ozgursumer(at)gmail(dot)com.


Go to top


Text

Your primary text will be your course notes, so please make sure you don't miss classes. If you do, you should copy somebody's class notes and discuss the class with them.

There will also be frequent handouts and web postings. Please always check this website.

Printed text:

Jon Kleinberg - Éva Tardos: "Algorithm Design"

Pearson/Addison-Wesley, Publ. 2005

ISBN 0-321-29535-8

available at the Seminary Co-op Bookstore (5757 S University Avenue)
Go to top


Grading

Grades are based on class participation (5%), homework (20%), 5 quizzes (6% each), a midterm (40 minutes, 15%) and the final exam (30%). The tests are "closed book" (no books or notes). Calculators may be used for basic arithmetic, logarithms and exponentials but not for more complex calculations such as g.c.d's or modular exponentiation.

Test dates

Quiz 1: Tuesday, January 16

Quiz 2: Tuesday, January 23

Quiz 3: Thursday, February 1

Midterm (40 min): Thursday, February 15

Quiz 4: Tuesday, February 27

Quiz 5: Thursday, March 8

Final exam: Thursday, March 15, 8:00 - 10:00 am
Go to top


Rules on HOMEWORK

Unless otherwise stated, homework is always due the next class (before class). Please always check the website for updates. The problems will be posted shortly after class. However, errors may occur, so please check the website, especially if you suspect an error. If you find an error or something that looks suspicious in an assignment, please notify the instructor (by email). If you are the first to point out a serious error, you may receive bonus points. "DO" problems are meant to check your understanding of the concepts. Do them but do not hand them in. If you encounter any difficulties, please check with a TA during office hours. Challenge problems don't have a specific deadline except they cease to be assigned once they have been discussed in class. If you are working on a challenge problem, please send email to the instructor so as to avoid the problem being discussed before you handed in the solution. Solutions to Challenge problems don't earn you credit toward your grade but they do earn you the instructor's respect, in addition to giving you valuable experience.

Policy on collaboration

Studying in groups is strongly encouraged. Collaboration on current homework is discouraged but not prohibited. If you do collaborate, state it at the beginning of your solution (give name of collaborator). DO NOT COPY someone else's solution: after the discussion, throw away any written records. Understand the ideas discussed and give your own rendering. The same applies to other sources such as the Web: give the source (URL), but DO NOT COPY. Understand; then write your own version without looking at the source or your notes.

Go to top

Return to the Department of Computer Science home page