CS 3343/3341: Analysis of Algorithms

If you order this book online, be sure it is the 2nd edition. Supposedly, the international edition has the same contents (cheaper paper and binding?), but I cannot verify this. The following link shows some booksellers that say they have it in stock:
www.valorebooks.com

Syllabus and Assignments

Syllabus for Fall 2006

Homeworks

Answers for homeworks have been moved to
WebCT.

Homework 1 (the Latex file), Homework 2 (the Latex file), Homework 3 (the Latex file), Homework 4 (the Latex file), Homework 5.

Homework 6, Homework 7, Homework 8, Homework 9, Homework 10, Homework 11.

Projects

Project 1 (empirical analysis of a unique elements algorithm),
Project 2,
Project 3 (using a hash table to test sorted array).

Notes (subject to change)

Introduction.
Fundamentals in the Analysis of Algorithm Efficiency.
Brute Force.
Divide and Conquer.
Decrease and Conquer.
Transform and Conquer.
Space and Time Tradeoffs.
Dynamic Programming.
Greedy Algorithms.
Iterative Improvement.
Limitations of Algorithms (Java program illustrating numeric problems and its output)

Other

Back to Tom Bylander's Home Page