Expectations

All work you hand in must be your own work, performed without the help of other individuals or outside sources. Discussion with others is allowed only for clarification and to understand the background. Having another person explain a solution to you and then writing it up on your own is cheating. If you feel your discussion with others may have crossed the line, you are expected to list the names of the students you collaborated with. You are also expected to list any resources you consulted and which helped you obtain your solution.

You are expected to have read http://spaf.cerias.purdue.edu/cpolicy.html and to have read and signed the departmental academic integrity policy.

Please
read the general homework
guidelines so you understand how to best present and organize your solutions.

Assignments are due before class starts.

- Assignment 1, due January 23
- Assignment 2, due February 6
- Assignment 3, due February 20
- Assignment 4, due March 6
- Assignment 5, due April 3
- Assignment 6, due April 17
- Assignment 7, due May 1

Related Material

- Theoretical Computer Science Cheat Sheet.
- Ten pages of mathematical formulas and other useful information for computer scientists compiled by Steve Seiden : TCScheat.pdf

- Related algorithm text books
- Algorithm Design, J. Kleinberg, E. Tardos, Pearson AddisonWesley, 2006
- Computer Algorithms: Introduction to Design and Analysis, S. Baase, AV Gelder, Prentice Hall, 2000 (3rd edition)
- Algorithms, S. Dasgupta, Ch. Papadimitriou, U. Vazirani, McGraw Hill, 2008
- MIT OpenCourseWare
- This site contains links to a corresponding algorithm course taught at MIT (SMA 5503); it provides supplementary material, practice material and selected lectures.
- Kleinberg-Tardos slides as revised by Kevin Wayne
- well done slides for a related textbiook
- Coursera's Algorithm Design Course (lectures by Tim