The proof of Hall's Theorem in class today evaporated when I forgot how to extract an augmenting path from the sequence of nodes found by applying Hall's condition starting from an unmatched node. See BipartiteGraphs for a working proof or CS202/Schedule/2005-10-21 for an explanation of the missing piece.
CS202/Assignments/HW06 has been clarified: the partial order in problem 2 is now explicitly a strict partial order (see Relations for the distinction between an ordinary partial order and a strict partial order).
- TA hours slightly changed.
CS202/Assignments/HW06 is available.
- Mean assignment grades are available below.
Grades for CS202/Assignments/HW04 are available in grade-o-matic. Graded homeworks are available outside AKW 401.
Solutions to CS202/Assignments/HW03 are now available.
CS202/Assignments/HW04 is available.
Solutions to CS202/Assignments/HW02 are now available.
CS202/Assignments/HW03 is available.
Grades for CS202/Assignments/HW01 are now available in Grade-o-Matic. Anyone for whom we have a working email address should have received an email giving their Grade-o-Matic login and password. (Some of you may have received as many as three such emails, for which we apologize. The password-mailing script required some last-minute debugging.) Graded assignments will be returned in class on Monday, or you can pick them up thereafter outside AKW 401.
- TA hours for Thursday changed (now 4:30-6:30 PM).
Solutions to CS202/Assignments/HW01 are available.
CS202/Assignments/HW02 is available.
Due to an error in the previous version, the first problem on CS202/Assignments/HW01 has changed. You are now asked to prove or disprove the logical equivalence. We apologize for the error.
- By popular request, assignments are now due at 11:00pm.
CS202/Assignments/HW01 is available.