CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2006

Discussion Assignment index page

Here are texts and solutions of discussion assignments for CMPSCI 311, Fall 2006. Solutions will normally be posted shortly after both sections have had their discussion section.

• Discussion #1: Proofs with Big-O (11 and 13 September 2006)

• Discussion #2: Proofs with Big-O (18 and 20 September 2006)

• Discussion #3: A Variable-Length Code (25 and 27 September 2006)

• Discussion #4: Huffman Coding (2 and 4 October 2006)

• Discussion #5: Subquadratic Multiplication (16 and 18 October 2006)

• Discussion #6: Another Prefix Code (23 and 25 October 2006)

• Discussion #7: Scheduling With Network Flow (30 October and 1 November 2006)

• Discussion #8: When Network Flow Doesn't Work (6 and 8 November 2006)

• Discussion #9: An NP-Complete School Scheduling Problem (13 and 15 November 2006)

• Discussion #10: Finding Small Hitting Sets (27 and 29 November 2006)

• Discussion #11: Bin Packing (4 and 6 December 2006)

Last modified 7 December 2006