C++ Plus Data Structures
Written by renowned author and educator Nell Dale, C++ Plus Data Structures, Fifth Edition explores the specifications, applications, and implementations of abstract data types with unmatched accessibility. Updated with new case studies and exercises throughout, this edition provides intuitive explanations that clarify abstract concepts, and approaches the study of data structures with emphasis on computer science theory and software engineering principles. 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 real-world exercises and case studies that define Nell Dale’s teaching philosophy, this Fifth Edition provides an increased emphasis on object-oriented design and an early introduction of object-oriented concepts. New and key features: • Object-oriented terminology now dominates computing vocabulary. Dale was careful to update all ADT names to reflect this terminology. • Additional exercises have been added to most chapters. • The Fifth Edition features the trademark Dale pedagogy and highlights numerous real-world, updated case studies. Each broad case study includes a description of the problem, an analysis of the problems input and required output, and a discussion of the appropriate data types to use. • Each chapter contains an average of 35 engaging exercises that span varying levels of difficulty. These exercises test students’ understanding of key concepts through various means, including programming problems and analysis of algorithm problems. • Downloadable instructor resources are available at go.jblearning.com/ndale. These include PowerPoint? lecture presentations, answers to end of chapter questions, a test bank, and an instructor’s manual containing goals, teaching notes, suggested in-class activities, and programming assignments for each chapter. • Students and instructors can also access program source code to work out all the examples and exercises from the text.
What people are saying - Write a review
We haven't found any reviews in the usual places.
1 Software Engineering Principles
2 Data Design and Implementation
3 ADT Unsorted List
4 ADT Sorted List
5 ADTs Stack and Queue
6 Lists Plus
7 Programming with Recursion
8 Binary Search Trees
9 Priority Queues Heaps Graphs and Sets
Other editions - View all
abstract data type array-based Big-O Big-O notation binary search tree binary tree bool Boolean cards chapter const contains copy copy constructor cout CRC card currentPos data member data structure deck declared defined delete DeleteItem Dequeue doubly linked list empty endl Enqueue error execution false Figure function call Function return GetNextItem graph hash function heap HeapSort information hiding initialized input insertion integer IsFull iterator linked list listData logical loop MakeEmpty member function MergeSort moreToSearch namespace newItem newNode nodePtr NodeType NULL number of elements number of items O(log2N object operations output parameter parentPtr pastLast pointer position Postcondition Precondition predLoc priority queue problem PutItem QuickSort recursive call return value Returns true Sorted List sorting algorithms specification stack stored string struct subtree template template<class ItemType tempPtr tion Unsorted List ADT UnsortedType variable vertex void Write