book

C++ Plus Data Structures, 6th Edition

Name: C++ Plus Data Structures, 6th Edition
ISBN: 9781284089196

by Nell Dale, Chip Weems, Tim Richards

August 2016

Intermediate to advanced

838 pages

22h

English

Jones & Bartlett Learning

Read now

Unlock full access

Cover Page
Title Page
Copyright Page
Contents
Preface
1 Software Engineering Principles
1.1 The Software ProcessSoftware Life CyclesA Programmer’s ToolboxesGoals of Quality SoftwareSpecification: Understanding the ProblemWriting Detailed Specification1.2 Program DesignAbstractionInformation HidingStepwise RefinementVisual Tools1.3 Design Approaches 17Top-Down DesignObject-Oriented Design1.4 Verification of Software CorrectnessOrigin of BugsDesigning for CorrectnessProgram TestingTesting C++ Data StructuresPractical ConsiderationsCase Study: Fraction ClassSummaryExercises
2 Data Design and Implementation
2.1 Different Views of DataWhat Do We Mean by Data?Data AbstractionData StructuresAbstract Data Type Operator Categories2.2 Abstraction and Built-In TypesRecordsOne-Dimensional ArraysTwo-Dimensional Arrays2.3 Higher-Level Abstraction and the C++ Class TypeClass SpecificationClass ImplementationMember Functions with Object ParametersDifference Between Classes and Structs2.4 Object-Oriented ProgrammingConceptsC++ Constructs for OOP2.5 Constructs for Program VerificationExceptionsNamespaces2.6 Comparison of AlgorithmsBig-OCommon Orders of MagnitudeExample 1: Sum of Consecutive IntegersExample 2: Finding a Number in a Phone BookCase Study: User-Defined Date ADTSummaryExercises
3 ADT Unsorted List
3.1 Lists3.2 Abstract Data Type Unsorted ListLogical LevelAbstract Data Type OperationsGeneric Data TypesApplication LevelImplementation Level3.3 Pointer TypesLogical LevelApplication LevelImplementation Level3.4 Implementing Class UnsortedType as a Linked StructureLinked StructuresClass UnsortedTypeFunction PutItemConstructorObserver OperationsFunction MakeEmptyFunction GetItemFunction DeleteItemFunctions ResetList and GetNextItemClass Destructors3.5 Comparing Unsorted List ImplementationsCase Study: Creating a Deck of Playing CardsSummaryExercises
4 ADT Sorted List
4.1 Abstract Data Type Sorted ListLogical LevelApplication LevelImplementation Level4.2 Dynamically Allocated Arrays4.3 Implementing the Sorted List as a Linked StructureFunction GetItemFunction PutItemFunction DeleteItemCodeComparing Sorted List Implementations4.4 Comparison of Unsorted and Sorted List ADT Algorithms4.5 Bounded and Unbounded ADTs4.6 Object-Oriented Design MethodologyBrainstormingFilteringScenariosResponsibility AlgorithmsFinal WordCase Study: Evaluating Card HandsSummaryExercises
5 ADTs Stack and Queue
5.1 StacksLogical LevelApplication LevelImplementation LevelAlternate Array-Based Implementation5.2 Implementing a Stack as a Linked StructureFunction PushFunction PopFunction TopOther Stack FunctionsComparing Stack Implementations5.3 QueuesLogical LevelApplication LevelImplementation LevelCounted Queue5.4 Implementing a Queue as a Linked StructureFunction EnqueueFunction DequeueA Circular Linked Queue DesignComparing Queue ImplementationsCase Study: Simulating a Solitaire GameSummaryExercises

6 Lists Plus
6.1 More About Generics: C++ Templates6.2 Circular Linked ListsFinding a List ItemInserting Items into a Circular ListDeleting Items from a Circular List6.3 Doubly Linked ListsFinding an Item in a Doubly Linked ListOperations on a Doubly Linked List6.4 Linked Lists with Headers and Trailers6.5 Copy StructuresShallow Versus Deep CopiesClass Copy ConstructorsCopy FunctionOverloading Operators6.6 A Linked List as an Array of RecordsWhy Use an Array?How Is an Array Used?6.7 Polymorphism with Virtual Functions6.8 A Specialized List ADTTest Plan6.9 Range-Based IterationCase Study: Implementing a Large Integer ADTSummaryExercises
7 Programming with Recursion
7.1 What Is Recursion?7.2 The Classic Example of Recursion7.3 Programming RecursivelyCoding the Factorial Function7.4 Verifying Recursive FunctionsThree-Question Method7.5 Writing Recursive FunctionsWriting a Boolean Function7.6 Using Recursion to Simplify Solutions7.7 Recursive Linked List Processing7.8 A Recursive Version of Binary Search7.9 Recursive Versions of PutItem and DeleteItemFunction PutItemFunction DeleteItem7.10 How Recursion WorksStatic Storage AllocationDynamic Storage Allocation7.11 Tracing the Execution of Recursive Function Insert7.12 Recursive Quick Sort7.13 Debugging Recursive Routines7.14 Removing RecursionIterationStacking7.15 Deciding Whether to Use a Recursive SolutionCase Study: Escaping from a MazeSummaryExercises
8 Binary Search Trees
8.1 SearchingLinear SearchingHigh-Probability OrderingKey OrderingBinary Searching8.2 Trees8.3 Logical Level8.4 Application Level8.5 Implementation Level8.6 Recursive Binary Search Tree OperationsFunctions IsFull and IsEmptyFunction GetLengthFunction GetItemFunction PutItemFunction DeleteItemFunction PrintThe Class Constructor and DestructorCopying a TreeMore About TraversalsFunctions ResetTree and GetNextItem8.7 Iterative Insertion and DeletionSearching a Binary Search TreeFunction PutItemFunction DeleteItemTest PlanRecursion or Iteration?8.8 Comparing Binary Search Trees and Linear ListsBig-O ComparisonsCase Study: Building an IndexSummaryExercises
9 Heaps, Priority Queues, and Heap Sort
9.1 ADT Priority QueueLogical LevelApplication LevelImplementation Level9.2 A Nonlinked Representation of Binary Trees9.3 HeapsLogical LevelApplication LevelImplementation LevelApplication Level RevisitedHeaps Versus Other Priority Queue Representations9.4 Heap SortSummaryExercises
10 Trees Plus
10.1 AVL TreesSingle Rotations on AVL TreesGeneralizing Single Rotations on AVL TreesDouble Rotations on AVL TreesGeneralizing Double Rotations on AVL TreesApplication LevelLogical LevelImplementation Level10.2 Red-Black TreesInserting into Red-Black TreesImplementing Recoloring for Red-Black TreesRed-Black Tree Summary10.3 B-TreesSummaryExercises
11 Sets, Maps, and Hashing
11.1 SetsLogical LevelApplication LevelImplementation Level11.2 MapsLogical LevelApplication LevelImplementation Level11.3 HashingCollisionsChoosing a Good Hash FunctionComplexitySummaryExercises
12 Sorting
12.1 Sorting Revisited12.2 Straight Selection Sort12.3 Bubble Sort12.4 Insertion Sort12.5 O(N log2 N) SortsMerge SortQuick SortHeap SortTesting12.6 Efficiency and Other ConsiderationsWhen N Is SmallEliminating Calls to FunctionsProgrammer TimeSpace ConsiderationsKeys and StabilitySorting with PointersCaching12.7 Radix SortAnalyzing the Radix Sort12.8 Parallel Merge SortSummaryExercises
13 Graphs
13.1 GraphsLogical LevelApplication LevelImplementation LevelSummaryExercises
Appendix A Reserved Words
Appendix B Operator Precedence
Appendix C A Selection of Standard Library Routines
Appendix D American Standard Code for Information Interchange (ASCII) Character Sets
Appendix E The Standard Template Library (STL)
Glossary
Index

Content preview from C++ Plus Data Structures, 6th Edition

CHAPTER 4: ADT Sorted List

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781284089196

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

C++ Plus Data Structures, 6th Edition

by Nell Dale, Chip Weems, Tim Richards

CHAPTER 4: ADT Sorted List

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.