CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2003

Homework Assignments and Solutions

This page will contain assignments and solutions for the written homework assignments for CMPSCI 311.

There will be nine homework assignments, three in each section of the course. The best seven will each count 4% of the final grade, the eighth best will count 2%, and the worst will be dropped.

• Homework 1, due Fri 12 September 2003

• Homework 2, due Fri 19 September 2003

• Homework 3, due Fri 26 September 2003

• Homework 4, due Fri 17 October 2003

• Homework 5, due Fri 24 October 2003

• Homework 6, due Fri 31 October 2003

• Homework 7, due Fri 21 November 2003

• Homework 8, due Fri 5 December 2003

• Homework 9, due Fri 12 December 2003

Academic Honesty: You are allowed to collaborate on the homework problems, and to research them in books and on the web, but I insist that the presentation of the answers be your own work. Violation of this policy may result in my failing you for the course, even on a first offence . More specifically:

• You must document all sources of help, e.g., "I discussed this homework with Bob, Carol, Ted, and Alice, and read the solution to a similar problem at www.easyanswers.com/algorithms." If, for example, you hand in a solution that is taken from such a source that you have not documented, you are in trouble.

• Even when you have documented the source, the presentation must be yours. Two solutions from different students that are identical or very similar are usually evidence of a violation of this honesty policy. The time to stop collaborating is when you shift from figuring out the idea of the solution to actually writing the solution down. If you understand the solution and express it in your own words without another source in front of you, it will generally be clear that you have not copied.

Last modified 2 September 2003