Computer Science

• NEW - Completely revised coding examples—Have a much stronger object-oriented programming emphasis and include templates.

  • Students learn how to implement real programs and compare different techniques to see what really works best in a given situation. They learn data structures principles within the context of real programming examples. Ex.___

• NEW - Many more exercises.

  • More opportunity for students to apply what they learn and to develop their analytical abilities. Ex.___

• NEW - Better explanation of the design choices that lead to the programming examples.

  • Helps students better connect the theory and examples. Ex.___

• NEW - Chapter 3—Covers common misconceptions about algorithm analysis.

  • Helps students avoid these mistakes. Ex.___

• NEW - Expanded coverage of the Dictionary Abstract Data Type (ADT).

  • Better links together some of the data structures that are presented. Ex.___

• Basic algorithm analysis presented early in the text—Uses relevant techniques throughout the rest of the text.

  • The techniques provided assume a range of instructional levels so that they may be used by students with varying backgrounds in the subject. Provides ample examples of how algorithm analysis is used. Ex.___

• Figures and/or case examples—Provided for nearly all algorithms.

  • Gives clear explanations and illustrations for most of the fundamental data structures and algorithms in the text. Ex.___

• Programming examples are written in C++—Features of C++ that do not support the data structures principles discussed are not included.

  • Makes examples of how data structures work as clear as possible while maintaining the advantage of C++. Ex.___

• Integrated treatment of both in-memory and disk-based algorithm techniques.

  • Shows students how these techniques are related and the key differences between them, enabling them to program in a time- and space-efficient manner. Ex.___

• End-of-chapter “Further Reading” sections.

  • Point students to resources that are exceptionally informative or should become familiar to any well-rounded computer scientist. Ex.___

• Completely revised coding examples—Have a much stronger object-oriented programming emphasis and include templates.

  • Students learn how to implement real programs and compare different techniques to see what really works best in a given situation. They learn data structures principles within the context of real programming examples. Ex.___

• Many more exercises.

  • More opportunity for students to apply what they learn and to develop their analytical abilities. Ex.___

• Better explanation of the design choices that lead to the programming examples.

  • Helps students better connect the theory and examples. Ex.___

• Chapter 3—Covers common misconceptions about algorithm analysis.

  • Helps students avoid these mistakes. Ex.___

• Expanded coverage of the Dictionary Abstract Data Type (ADT).

  • Better links together some of the data structures that are presented. Ex.___

(NOTE: Each chapter concludes with Further Readings, Exercises, and/or Projects.)

I. PRELIMINARIES.

II. FUNDAMENTAL DATA STRUCTURES.

III. SORTING AND SEARCHING.

IV. APPLICATIONS AND ADVANCED TOPICS.

V. APPENDIX.

C++ Data Structures  (Computer Science)
C++ Advanced Data Structures  (Computer Science)

In this eagerly anticipated revision, Clifford A. Shaffer provides a thorough and comprehensive treatment of fundamental data structures and the principles of algorithm analysis. The author focuses on teaching students and practitioners how to create efficient data structures and algorithms and to understand the principles required to select or design the data structure that will best solve the problem. The integrated treatment of algorithm analysis, file processing, and efficiency places this book in a class of its own.

Features:

• Algorithm analysis techniques are presented throughout the text. Analysis is closely tied to the needs of practicing programmers and students. It is not presented as theory for theory's sake.
• Coverage of basic file processing techniques as an integral component of efficient data structures and algorithm analysis.
• C++ is used as a tool to illustrate data structure concepts with clear, simple-to-understand examples. All programming examples are actual C++ code.
• This book presents each data structure and algorithm as having costs and benefits, and provides the reader with a thorough understanding of how to assess the costs and benefits, including space comparisons for data structures, space/time trade-offs, and special-purpose uses of data structures or algorithms.

New to this Edition:

• Completely rewritten coding examples that are clear and illustrative. Extensive use of object-oriented programming techniques.
• Expanded coverage of recursion, Dictionary ADT, balanced tress, and buffer pools.
• More emphasis on techniques for object-oriented program design.
• More exercises and examples. Close to 350 problems and projects.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.