Advanced Algorithms, CS 441/541
Textbook: "Algorithm Design", Jon Kleinberg, in stock at the
bookstore, and also online at Amazon.
Course Overview
Collaboration Policy
Lecture Topics will approximately follow the
online syllabus.
Homework 0 is available here.
The last proof of class 1 is fixed
here.
Homework 1 is available here.
You must turn it in with a signed
cover sheet.
Homework 1 solutions are available here.
Homework 2 is available here,
solutions
Errata: on the bottom of page 5, S2 should be
S3.
Homework 2 Practice Problems and Solutions are available here.
LP applet from monday in class is
here.
Homework 3 is available here, with a collection
of practice problems (of which 1-5 are solved) available
here.
Homework 3 solutions are available here.
Homework 4 is available here. Note that it
is due on Nov. 5.
Homework 4 solutions are available here.
Approximation algorithm practice problems, with solutions, are
here.
Midterm 3 solutions are here.
Homework 5 is available, with an updated problem 2 here.
Sally Goldman's Notes on Adversary Arguments
Jeff
Erickson's Notes on Adversary Arguments
NEW Approximate grading scale.
First, compute your TOTAL SCORE as hw1 + hw2 + hw3 + hw 4 + 2*(Midterm1+midterm2).
Relative to this total score, the approximate grading scale is:
441:
TOTAL SCORE: 310 .... A-
280 .... B-
250 .... C
541:
TOTAL SCORE: 370 .... A-
320 .... B-
TA Office Hours, Held in the M&M lab, 5th floor of Lopata.
Nathaniel Roman (ngr1 (at) cec), Mondays, 4-6
David Ross (dyr1 (at) cec), Tuesdays 2:00-4:00
Richard Speyer (richard.speyer (at) wustl ), Thursdays, 2-4
My Office Hours, Held in Lopata 518
Tuesdays 10:00-12:00 (morning)
Wednesdays 3:00-5:00 (afternoon)