CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2003

Discussion Notes and Solutions

This page will contain notes and solutions for the written assignments during the discussion sessions of CMPSCI 311. The links below will be made active after the corresponding session.

Discussion meetings are on Wednesdays 12:20-1:10 pm in Marston 132. Each discussion session will have a written assignment to be completed during the session, with help from other students, the instructor, and the TA. Grades for these assignments (generally "absent, "check", or "check-plus") will constitute 10% of the total course grade.

• No Discussion on 3 Sept 2003

• Discussion 1, 10 Sept 2003: Review of Induction Proofs (solution)

• Discussion 2, 17 Sept 2003: Solving Recurrences (solution)

• Discussion 3, 24 Sept 2003: Applying the Master Theorem (solution)

• Discussion 4, 1 Oct 2003: Multiplying Large Integers (solution)

• Discussion 5, 8 Oct 2003 Fun With Depth-First Search (solution)

• No Discussion on 15 Oct 2003 (Monday schedule)

• Discussion 6, 22 Oct 2003 Fun With Permutations (solution)

• Discussion 7, 29 Oct 2003 Counting Strings in Regular Languages (solution)

• Discussion 8, 5 Nov 2003 Counting and Radix Sorts (solution)

• Discussion 9, 12 Nov 2003 Minimum Cuts and Maximum Flows (solution)

• Discussion 10, 19 Nov 2003 Finding Maximum Flows (solution)

• Discussion 11, 3 Dec 2003 Polynomial-Time Reductions (solution)

• Discussion 12, 10 Dec 2003 Course Evaluations. A "check" will be given for filling out the UMass form and answering some other survey questions for me. There will be no "check-plus" grades for this discussion.

Last modified 3 December 2003