Computer Science

• NEW - Data structures presented using the model of the Standard Template Library (STL)—Over the course of the book, student master the use and implementation of the STL container classes.

  • Teaches students the modern approach to data structures. Ex.___

• NEW - Simple algorithms integrated throughout the text.

  • Includes an applied study of interesting and classical algorithms that illustrate the data structures using only simple mathematical concepts. (Big-O notation is introduced intuitively). Ex.___

• NEW - Many additional figures integrated into the presentation.

  • Lead students through the concepts. Ex.___

• NEW - ADT (Abstract Data Type) for each data structure—Immediately used to solve appropriate problems.

  • Book provides students with many examples before presenting the corresponding implementation so that students see a data structure unfold and are then able to trace back through the examples when looking at the implementation. Ex.___

• NEW - Early and accessible introduction to templates and iterators.

  • Allows students to understand and use powerful abstractions available in modern data structures. Ex.___

• NEW - Later chapters (Chapters 11 - 17) supplement the CS2 course.

  • Appropriate material for an advanced data structures and algorithms course. Ex.___

• Use of modern C++ constructs in developing data structures and their applications—Provides enough language detail to sufficiently understand the constructs. A fuller explanation of language details available on the Companion Website.

  • Reflects the type of data structures that students would use in the real world. Ex.___

• Extensive pedagogy—Includes many complete programs with output, case studies, review exercises with solutions, extensive written exercises and programming exercises, programming projects, and glossary of key terms.

  • Helps students learn, review, and retain material. Ex.___

• Data structures presented using the model of the Standard Template Library (STL)—Over the course of the book, student master the use and implementation of the STL container classes.

  • Teaches students the modern approach to data structures. Ex.___

• Simple algorithms integrated throughout the text.

  • Includes an applied study of interesting and classical algorithms that illustrate the data structures using only simple mathematical concepts. (Big-O notation is introduced intuitively). Ex.___

• Many additional figures integrated into the presentation.

  • Lead students through the concepts. Ex.___

• ADT (Abstract Data Type) for each data structure—Immediately used to solve appropriate problems.

  • Book provides students with many examples before presenting the corresponding implementation so that students see a data structure unfold and are then able to trace back through the examples when looking at the implementation. Ex.___

• Early and accessible introduction to templates and iterators.

  • Allows students to understand and use powerful abstractions available in modern data structures. Ex.___

• Later chapters (Chapters 11 - 17) supplement the CS2 course.

  • Appropriate material for an advanced data structures and algorithms course. Ex.___

(Most chapters end with Chapter Summary, Classes and Libraries in the Chapter, Review Exercises, Written Exercises, Programming Exercises and Programming Projects.)

Preface.


1. Introduction to Data Structures.

C++ Data Structures  (Computer Science)

Professor William Ford and Professor William Topp are faculty members with the Computer Science Department, University of the Pacific, Stockton, California. They have also written Introduction to Computing with C++ and Object Technology (Prentice Hall, 1999) and Assembly Language and Systems Programming for the M68000 Family (Jones and Bartlett, 1992).

This long-awaited second edition of Data Structures with C++ Using STL, by Professors Ford and Topp, provides a modern object-oriented approach to data structures using the model of the Standard Template Library (STL). The authors unify the study of data structures around the concepts of containers and iterators. The book skillfully develops algorithms for the data structures and their applications. Readers will find a systematic and detailed implementation for each data structure. These successful authors offer a learning tool that is motivated by a wealth of excellent examples and complete running programs.

KEY FEATURES

• Uses the early chapters to present object design and programming principles that are at the core of data structures.
• Develops clear and concise templates, which can support generic programming throughout the book.
• Uses the STL container classes throughout the book.
• Presents an Application Programming Interface (API) for each STL container and immediately uses it to solve problems.
• Demonstrates the implementation of the STL classes by developing mini-container classes that use the corresponding STL interface. The student can understand the overall design of the container and its C++ implementation code.
• Includes and intuitive and precise introduction to iterators that are at the core of modern data structures.
• Covers with the same careful style advanced topics such as red-black trees, hash tables, heaps, and graphs.
• Provides the reader with an extensive development of advanced recursion and inheritance as applied to data structures.
• Makes available valuable pedagogical features including chapter objectives and summaries; many complete programs with runtime output; case studies; review exercises with solutions for each chapter; extensive written and programming exercises; and a programming project for each chapter.
• Supplement: Instructor CD with solutions and a test item file; Companion Website containing language tutorials, students assessment materials, and PowerPoint slides.

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, browse our available packages below, or contact your Pearson Higher Education representative to create your own package.

Package ISBN-10: 0135121701 | ISBN-13: 9780135121702
©2007 | Instock (Additional assembly time required)
Suggested retail price: $317.80  Buy from myPearsonStore
Net price: $238.35  (What's this?)
This package contains: