CS 592 - Design and Analysis of Algorithms

Course Objective:

Enable students to learn basic concepts in algorithm design. Through the design and analysis of algorithms for sorting and searching, hashing, dynamic programming, graph problems, etc. the students will build a solid ground for algorithm analysis and problem solving. 

Course Description:

Combinatorial analysis, searching and sorting, shortest path algorithms, spanning trees, search and traversal techniques, backtracking, branch and bound, heuristics, algebraic simplification and transformation.

Textbook:

Introduction to Algorithms, Second Edition
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Published by McGraw Hill, ISBN 0-07-013151-1

My grade:    A

Note: I will make all my homework solutions available as I get time:)