Home Bookmarks Papers Blog

373 - Combinatorial Algorithms


Class notes, homeworks and exams are available here.
Sariel Har-Peled
CS 373, Spring 2003
14:00-15:15 TuTh, Altgeld 314
Official webpage
Anothr course

Homeworks

hw 0 [PDF]
hw 1 [PDF]
hw 2 [PDF]
hw 3 [PDF]
hw 4 [PDF]
hw 5 [PDF]
hw 6 [PDF]

Exams

Midterm 1 [PDF]
Midterm 2 [PDF]
Final [PDF]

Schedule
  1. 2001 fall schedule
  2. 2002 spring schedule
  3. 2002 fall schedule (jeff)

Homeworks


To be filled in.

Info about the course

Jeff Erickson have a webpage with several previous 373 courses. I am planning to follow his presentation.

What you must know before taking 373


What is it?

CS 373 is the standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois (unless you take the automata theory class CS 375, but relatively few students do that). This page contains all the teaching materials that my TAs and I have developed during the five times I've taught the course (thrice in reality and twice virtually).

Why shoud I take it?

The ability to design and analyze algorithms is a crucial ability in developing useful software. This course would hopefully provide you with the tools to compare between different algorithms (performing the same task), the ability to analyze them, the knowledge of how to choose between them, and the ability to design such algorithms yourself.



Administrivia

Prerequisites:
Students are assumed to have working knowledge of the material taught in CS 225 and CS 273. This is not the same as merely having passed! If you're an undergraduate and you haven't taken those classes, you need my permission to enroll.

Coursework:
Grades are based on 6 homeworks (30%) (dropping the lowest), two in-class midterms (20% each), and a final exam (30%). Undergrdauates and graduate students are graded on separate scales. Graduate students have some additional homework and exam problems; undergrads can solve the graduate homework problems for extra credit.

Textbook:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and clifford Stein.
Introduction to Algorithms (Second Edition), MIT Press / McGraw-Hill, 2001. Required.
Graduate students - register for 3/4, 7/8, 15/16, 31/32 or 1 unit?
There is not going to be any difference in the requirements between students registered for this course for 3/4 or 1 unit, so you might as well register for 1 unit.

Last modified: Mon Sep 4 20:23:28 EDT 2000