CS 381: Assignments and Related Material

---

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 you 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 before they are graded.
Assignments are due in class before lectures start.

• Assignment 1
• Assignment 2,
• Assignment 3
• Assignment 4
• Assignment 5
• Assignment 6
• Assignment 7
• Assignment 8
  

---

Related Material

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

• MIT OpenCourseWare
• Site contains links to a corresponding algorithm course taught (SMA 5503); it provides supplementary material, practice material and selected lectures. 
• Kleinberg-Tardos slides as revised by Kevin Wayne
• slides for a related textbook
• Coursera's Algorithm Design Course
• well done lectures by Tim Roughgarden
• Related algorithm text books
• Algorithm Design, J. Kleinberg, E. Tardos, Pearson AddisonWesley, 2006
• Algorithms, S. Dasgupta, Ch. Papadimitriou, U. Vazirani, McGraw Hill, 2008

---