x

Our Privacy Policy has changed. By using this site, you agree to the Privacy Policy.

C++ Classes and Data Structures

ISBN-10: 0131580515
ISBN-13: 9780131580510
Edition: 2008
List price: $181.20
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Most books on data structures are filled with so many technical details (and lack thorough explanations) that the reading becomes difficult. This accessible, conversational presentation explores data structures concepts in clear language.Assumes a  More...

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $181.20
Copyright year: 2008
Publisher: Prentice Hall PTR
Publication date: 8/10/2007
Binding: Paperback
Pages: 416
Size: 7.00" wide x 9.00" long x 1.10" tall
Weight: 2.2
Language: English

Most books on data structures are filled with so many technical details (and lack thorough explanations) that the reading becomes difficult. This accessible, conversational presentation explores data structures concepts in clear language.Assumes a basic knowledge of C++. Focuses on the client for all programs, classes, and data structures. Offers meaningful, relevant examples and worked examples throughout. Includes thoroughly tested code. Provides code for all examples.A useful reference for anyone interested in learning more about programming.

Structs and Classes
Structs
Basic Class Concepts
Class Implementation
Testing a Class
Placing Function Definitions in the Class Definition (and Why We Shouldnt)
Commenting a Class
The Differences Between a Struct and a Class
Overloaded Operators, Class Templates, and Abstraction
Overloaded Operators
Using a Check Struct in the Checkbook Class
Class Templates
Classes and Abstraction
The const Specifier, Constructors, and Class Modification
The const Specifier
Constructors
An Example
Class Modification
Modifying the Checkbook Class to Keep a History of Checks
Purpose of the Private Section
A Summary of the Advantages of Classes
Pointers and Dynamic Arrays
Pointers
The [ ] Operator
Dynamically Allocated Memory
Dynamic Arrays
The delete Operator
Pointers to Objects
Running Out of Heap Memory
Adjustable Arrays
An Array Class
Array Class Template
Using the Array Class
Destructors
The Overloaded Assignment Operator
Copy Constructors
An Example
Advantages and Disadvantages of an Array Class
Methods for Making Data Structures
Using Arrays in Data Structures
Sorting Arrays
Introduction to Linked Structures
Arrays vs. Linked Lists
Writing Code for Linked Lists
The Linked List Implementation of Basic Data Structures
Basic Queue Concepts
Linked List Implementation of a Queue
Other Implementations
Linked List Implementation of a Stack
The Array Implementation of Basic Data Structures
Array Implementation of a Stack
Array Implementation of a Queue
Introduction to Time Complexities
Time Complexity Basics
The Constant Time Complexity
Big-oh Notation
The Logarithmic Time Complexity
The Binary Search Algorithm
Computer Speed Where Does it Really Come From?
Time Complexities of Data Structure Functions
The Linked List as a Data Structure
Using Key Values in Objects
Linked List Implementation
Other Implementations
Hash Tables
Basics About Hash Tables
Implementation Issues for a Hash Table
Pointers to Functions
A Hash Table Implementation
Using the Hash Table Implementation
A Hash Table Implementation of a Doubly-Linked List
Priority Queues, Trees, and Heaps
Priority Queue Basics
Implementation Issues for Priority Queues
Trees
Heaps
Implementation Issues for Heaps
A Heap Implementation of a Priority Queue
Heapsort
Recursion
A Recursive Factorial Function
A Stack of Activation Records
Guidelines for Writing Recursive Functions
Using Recursion on Linked Structures
Time Complexities of Recursive Functions
Other Data Structures
Binary Search Trees
Graphs
Comparing Adjacency Matrices to Adjacency Lists
How to Compile and Work With Multiple-File Programs
Amortized Analysis of Array Expansion and Contraction
Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×