Algorithms and Programming: Problems and Solutions

Front Cover
Birkhäuser, 1997 - Computer algorithms - 217 pages
Each chapter is more or less independent, containing classical and well-known problems supplemented by clear and in-depth explanations. While program examples are written in Pascal, any other procedural language (e.g., Modula, Oberon, C) may be used instead. Problems at all different levels progress in difficulty. Some problems are somewhat loosely connected to one another, and others are devoted to one specific algorithm (e.g., section on LR-parsing). The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Contents 222
Generation of combinatorial objects
Tree traversal backtracking

12 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information