CS473UG - Algorithms (undergraduate section) - Spring 2007

Tue Thu 11:00-12:15, 1404 Siebel Center

Instructor:
Mahesh Viswanathan (vmahesh AT uiuc DOT edu), 3232 Siebel Center
Office hours: Tuesday and Friday from 10:00-11:00 or by arrangement

Teaching assistants: Office hours will be held in the alcove outside 3240 Siebel Center.

Final Exam Office Hours
John Fischer   Office hours: Thursday 12:15-1:15pm
Viraj Kumar   Office hours: Friday 6-10pm. For other days, email me to fix a time.
                       For conflict exam: Sunday 3-7pm

Announcements:

Tuesday, May 8 Monday, May 7 Wednesday, May 2 Tuesday, May 1 Monday, April 23 Tuesday, April 17 Tuesday, April 10 Tuesday, April 3 Thursday, March 29 Wednesday, March 28 Monday, March 26 Saturday, March 10 Thursday, March 8 Tuesday, March 6 Tuesday, February 27 Thursday, February 22 Monday, February 19 Sunday, February 18 Saturday, February 17 Friday, February 16 Thursday, February 15 Tuesday, February 13 Tuesday, February 6 Sunday, February 4 Tuesday, January 30 Sunday, January 28 Friday, January 26 Thursday, January 25 Tuesday, January 23 Thursday, January 18 Wednesday, January 17

Course materials:

Administrivia:

Prerequisites:
Students are assumed to have mastered the material taught in CS 225 (basic algorithms and data structures) and CS 273 (discrete mathematics). Please note that "mastery" is not the same as "exposure" or even "a good grade". Hence, Homework Zero.

Required textbook:
Jon Kleinberg and Éva Tardos. Algorithm Design. Addison-Wesley, 2005.

Newsgroup: class.cs473ug on the news server news.cs.uiuc.edu
You must sign up for access if you have not already done so.

Exams:
There will be two midterms scheduled during regular class times (in the regular classroom) on Tuesday February 20, and Thursday March 29. The Final exam for this course is on Saturday May 5, between 1:30pm and 4:30pm

Coursework and Grading:
Ignoring bonus points, and allocating 20% to each midterm, 35% for the final exam, and 25% for oral group presentations and written homeworks, the following ranges correspond to the indicated "unadjusted" grades. Class Percentile is computed after first eliminating "bottom dwellers" from the pool. This group, up to a maximum of 5% of class, comprises those students who in the opinion of the professor appear to have given up, or are not trying, or do not realize they are actually enrolled.

Use whichever criterion (class percentile, coursework percentage) gives the most favorable grade

Class PercentileGradeCoursework Percentage Earned
95A+95
85A93
80A-90
70B+87
60B83
50B-80
40C+77
30C73
20C-70
15D+67
10D63
5D-60
<5F< 60

The Class Percentile above (left column) is meant as the main grading criterion. The Coursework Percentage (right column) may result in a higher grade in the event that there is little spread on the course distribution, rendering percentile less informative. Typically this happens when exams and homeworks are too easy (which is another way of saying that typically this doesn't happen). The instructor reserves the right to make the cutpoints in the Coursework Percentage column more generous, except for the A+ grade cut-off.

After base grades are calculated, extra credit from head-banging session and from typing homework will be factored in. Extra credit will modify your base grade by at most half a letter grade. So if you are failing, it will probably not help you, but if you have a B+, it might help you raise your grade to an A-.

Why are there two algorithms classes?