Problems on Algorithms

Problems on Algorithms, 1/e

Ian Parberry

Published February, 1995 by Prentice Hall Engineering/Science/Mathematics

See other books about:
Algorithms-Computer Science

Summary

Too often the problem sets in standard algorithm texts are composed of small, idiosyncratic units of busy-work and irrelevant questions — forcing instructors into the time-consuming task of finding or composing additional problems. Designed to fill that gap, this supplement provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms.

Features

provides approximately 600 problems and 35 worked examples — focused on only the most important areas of algorithm design and analysis:

background material — mathematical induction, big-$O$ notation, recurrence relations, correctness proofs, and basic algorithm analysis methods.
algorithm design technique — divide-and-conquer, dynamic programming, greedy algorithms, and exhaustive search.
advanced data structures and NP-completeness.
miscellaneous problems for which part of the problem is to determine the algorithmic technique or techniques to be used.

expresses algorithms in Pascal-like pseudocode.
provides an abundance of figures and diagrams.
features worked examples, hints, solutions, and comments on selected problems.
provides various preambles that summarize the background knowledge needed to solve the problems.
useful for self-study.

1. Introduction.
2. Mathematical Induction.
3. Big-O and Big-…W.
4. Recurrence Relations.
5. Correctness Proofs.
6. Algorithm Analysis.
7. Divide-and-Conquer.
8. Dynamic Programming.
9. Greedy Algorithms.
10. Advanced Data Structures.
11. Exhaustive Search.
12. NP-completeness.
13. Miscellaneous.
Bibliography.