Algorithms and Programming: Problems and Solutions, 2nd Edition

This text is structured in a problem-solution format that requires the student to think through the programming process. New to the second edition are additional chapters on suffix trees, games and strategies, and Huffman coding as well as an Appendix illustrating the ease of conversion from Pascal to C.

Table of Contents

1 Variables, expressions, assignments
2 Generation of combinatorial objects
3 Tree traversal (backtracking)
4 Sorting
5 Finite-state algorithms in text processing
6 Data types
7 Recursion
8 Recursive and non-recursive programs
9 Graph algorithms
10 Pattern matching
11 Games analysis
12 Optimal coding
13 Set representation. Hashing
14 Sets, trees, and balanced trees
15 Context-free grammars
16 Left-to-right parsing (LR)
Appendix: C and Pascal examples