Introduction -- Elementary Data Structures -- Divide-and-Conquer -- The Greedy Method -- Dynamic Programming -- Basic Traversal and Search Techniques -- Backtracking -- Branch-And-Bound -- Algebraic Problems -- Lower Bound Theory -- NP-Hard and NP-Complete Problems -- Approximation Algorithms -- PRAM Algorithms -- Mesh Algorithms -- Hypercube Algorithms.