CS
381: Assignments and Related Material
Course Textbook
Introduction to Algorithms, T. Cormen, C. Leiserson, R. Rivest, C. Stein, McGraw-Hill, 2001 (2nd edition).
Course will cover material from chapters 1-25, 32-35.
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, it is to your
advantage to list the names of the students you collaborated with.. You are
always 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 Wednesday, September 3, 2008
- Assignment 2, due Friday, September 12, 2008
- Assignment 3, due Wednesday, September 24, 2008
- Assignment 4, due Monday, October 6, 2008
- Sample Midterm Questions
- Assignment 5, Problems 1&2 due Friday, October 24, problems 3&4 due Monday, October 27, 2008
- Assignment 6, due Wednesday, November 5, 2008
- Assignment 7, due Wednesday, November 19, 2008, 7graph.png
- Assignment 8, due Wednesday, December 3, 2008
- Assignment 9, due Friday, December 12, 2008
- Sample Final Exam Questions
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:
- Computer
Algorithms: Introduction to Design and Analysis, S. Baase,
AV Gelder, Prentice Hall, 1999 (3rd edition)
- Introduction
to Algorithms, A Creative Approach, U. Manber, Addison-Wesley, 1989.
- Algorithmics, G. Brassard and P. Bratley,
Prentice Hall, 1988.
- Algorithms, S. Dasgupta, Ch. Papadimitriou, U. Vazirani, McGraw Hill, 2008
- Algorithmic software development:
- The Stony Brook Algorithm Repository
. A collection of algorithm implementations for fundamental combinatorial
problems.
- LEDA : a C++ class library
for efficient data types and algorithms, including graph- and network
problems, geometric computations, combinatorial optimization and other.