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.
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.
Related
Material
· Related software development:
o The Stony Brook Algorithm Repository . A collection of algorithm implementations for fundamental combinatorial problems.
o LEDA : a C++ class library for efficient data types and algorithms, including graph- and network problems, geometric computations, combinatorial optimization and other.