CSC 512: Algorithms Analysis and Design

Review of major data structures - Basic design techniques - Divide and conquer - Greedy method - Backtracking - Dynamic programming - Heuristics - Parallel algorithms - Analysis of algorithms - Orders of magnitude - Lower bound theory - Time and space complexity - NP-hard and NP-complete problems - applications and examples - Correctness of algorithms - Structure of algorithms.