Nelson Higher Education

Higher Education

C++ Plus Data Structures + Navigate 2 Advantage Access, 6th Edition

  • Nell Dale
  • Chip Weems
  • Tim Richards
  • ISBN-10: 1284089185
  • ISBN-13: 9781284089189
  • 0 Pages | Hardcover
  • COPYRIGHT: 2018 Published
Request a Copy for Review


About the Product

C++ Plus Data Structures, Sixth Edition explores the specifications, applications, and implementations of abstract data types with unmatched accessibility. Topics such as modularization, data encapsulation, information hiding, object-oriented decomposition, algorithm analysis, life-cycle software verification models, and data abstraction are carefully presented to foster solid software engineering techniques. In addition to the real-world exercises and case studies that define Nell Dale’s teaching philosophy, the Sixth Edition provides a clear emphasis on object-oriented design and an early introduction of object-oriented concepts.


  • Updated throughout to include C++ 11

  • Pedagogical features include: chapter openers with goals, marginal definition boxes, algorithm boxes, C++ boxes, function boxes, case studies, chapter summary, and end-of-chapter exercises

About the Author

Nell Dale

Nell Dale received a B.S. in Mathematics and Psychology from the University of Houston, a M.A. in Mathematics, from the University of Texas at Austin, and a Ph.D. in Computer Sciences from the University of Texas at Austin. Nell Dale has been on the faculty at the University of Texas, Austin since 1975. She teaches occasionally but concentrates on computer science education, writing, traveling, tennis, and bridge -- and her family of course.

Table of Contents

Chapter 1: Software Engineering Principles
Chapter 2: Data Design and Implementation
Chapter 3: ADT Unsorted List
Chapter 4: ADT Sorted List
Chapter 5: ADTs Stack and Queue
Chapter 6: Lists Plus
Chapter 7: Programming with Recursion
Chapter 8: Binary Search Trees
Chapter 9: Heaps, Priority Queues, and Heap Sort
Chapter 10: Trees Plus
Chapter 11: Sets, Maps, and Hashing
Chapter 12: Sorting
Chapter 13: Graphs

New to this edition

  • Includes a new Chapter 10, Trees Plus, which empahsizes balancing of search trees by covering AVL Trees, Red-Black Trees, and B-Trees
  • Includes a new chapter on Sets, Maps, and Hashing
  • New emphasis on ADTs, with most algorithms introduced in the context of specific ADTs
  • Modern new design enhances the look and feel of the text