Page Tools:

C++ Plus Data Structures, Sixth Edition Includes Navigate 2 Advantage Access

Author(s): Nell Dale, PhD, University of Texas, Austin
Chip Weems, University of Massachusetts, Amherst
Tim Richards, University of Massachusetts, Amherst, Amherst, Massachusetts
  • ISBN-13: 9781284089189
  • Navigate 2 Advantage Access     838 pages      © 2018
Price: $185.95 US List
Add to Cart Request a Review Copy

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.


• UPDATED – Updated with new C++11 features including range-based for loops and threads
• NEW – Includes a new Chapter 10, Trees Plus, that emphasizes balancing of search trees by covering AVL Trees, Red-Black Trees, and B-Trees
 NEW – Includes a new chapter on Sets, Maps, and Hashing
• NEW – Chapter 12, Sorting, now includes practical performance issues and parallel merge sort
• NEW – Chapters in the second half of the text are now easier to assign in alternate orders, supporting a wider range of course goals and organizations
• NEW – Modern new design enhances the look and feel of the text
• STUDENT FAVORITE – 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

Applicable Courses

C++ Plus Data Structures, Sixth Edition assumes that students are familiar with the following C++ constructs; built-in simple data types, stream I/O as provided in <iostream>, stream I/O as provided in <fstream>, control structures while, do-while, for, if, and switch, user-defined functions with value and reference parameters, built-in array types, and class constructs.

Appropriate courses:

  • CS2/C102 with C++
  • Data Structures with C++
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  

Nell Dale, PhD-University of Texas, Austin

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.

Additional Titles by this Author

Chip Weems-University of Massachusetts, Amherst

Chip Weems is an Associate Professor of computer science at the University of Massachusetts at Amherst. He received his Bachelor's and Master's degrees from Oregon State University in 1977 and 1979, respectively. He received a Ph.D. from the University of Massachusetts in 1984. Over the last 23 years, he has taught courses in introductory programming, software engineering, computer architecture, and parallel processing. Since 1986 he has co-authored 13 textbooks that have helped over a million students learn to program computers. His books have been translated into French, Spanish, and Russian. He conducts research in computer architecture, compilers, parallel processing, and compiler-architecture co-optimization.

Tim Richards-University of Massachusetts, Amherst, Amherst, Massachusetts

The following instructor resources are available to qualified instructors for download

ISBN-13: 9781284089189

Answers to In-Text Questions
Instructor Manual
Slides in PowerPoint Format
Source Code
Test Bank
Transition Guide

This site uses cookies to store information on your computer. Some are essential to make our site work; others help us improve the user experience or allow us to communicate with you effectively. By using this site, you consent to the placement of these cookies. Read our cookie policy to learn more.

Agree & Dismiss