The basic purpose of this edition is to offer a new and greatly improved text for the classroom. Diverse personal interviews with famous computer scientists show how their careers developed. The book also includes topical recommendations made by the ACM Curriculum Committee.

Following standard introductions, we find a discussion of procedural abstraction, data abstraction, abstract data types, and program verification. Decision and selection control structures follow with looping and repetition statements. CS2 topics include analysis of algorithms, stacks, queues, trees, recursion, sorting, and searching. Since computer science has expanded greatly over the past 37 years, I would suggest that the text be divided into two lighter volumes. A short section on a graphical solution would show the relation between bits within words and display pixels. This would introduce the field of multimedia, which could be helpful for the next edition.

The book has no chapter references. One or two per chapter would be a real improvement. The typography of a typical program could be improved if the blue text were in boldface type to make it easier to read.

In summary, this is a very long but well written text. The chapters are well organized with excellent pedagogical features. The exercises are extensive, and the index is quite adequate.