| Description |
xxi, 702 pages, 123 unnumbered pages : illustrations ; 26 cm |
| Contents |
Pt. I. Problem-Solving Techniques. Ch. 1. Principles of Programming and Software Engineering. Ch. 2. Recursion: The Mirrors. Ch. 3. Data Abstraction: The Walls. Ch. 4. Linked Lists. Ch. 5. Recursion as a Problem-Solving Technique -- Pt. II. Problem Solving with Abstract Data Types. Ch. 6. Stacks. Ch. 7. Queues. Ch. 8. Class Relationships. Ch. 9. Algorithm Efficiency and Sorting. Ch. 10. Trees. Ch. 11. Tables and Priority Queues. Ch. 12. Advanced Implementation of Tables. Ch. 13. Graphs. Ch. 14. External Methods -- A. Review of C++ Fundamentals -- B. ASCII Character Codes -- C. C++ Header Files and Standard Functions -- D. Mathematical Induction |
| Summary |
Focusing on data abstraction and data structures, the second edition of this very successful book continues to emphasize the needs of both the instructor and the student. The book illustrates the role of classes and abstract data types (ADTs) in the problem-solving process as the foundation for an object-oriented approach. Throughout the next, the distinction between specification and implementation is continually stressed. The text covers major applications of ADTs, such as searching a flight map and performing an event-driven simulation. It also offers early, extensive coverage of recursion and uses this technique in many examples and exercises. Overall, the lucid writing style, widespread use of examples, and flexible coverage of material have helped make this a leading book in the field |
| Notes |
Includes index |
| Subject |
Abstract data types (Computer science)
|
|
C (Computer program language)
|
|
C++ (Computer program language)
|
|
Problem solving -- Data processing.
|
| Author |
Helman, Paul.
|
|
Veroff, Robert.
|
| LC no. |
97030265 |
| ISBN |
0201874024 |
|
