Skip to content

Applied Data Structures with C++

Best in textbook rentals since 2012!

ISBN-10: 0763725625

ISBN-13: 9780763725624

Edition: 2004

Authors: Peter Smith

List price: $194.95
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

Applied Data Structures with C++ is the ideal text for courses in: Advanced Data Structure Data Structures and Algorithms
Customers also bought

Book details

List price: $194.95
Copyright year: 2004
Publisher: Jones & Bartlett Learning, LLC
Publication date: 2/18/2004
Binding: Paperback
Pages: 692
Size: 7.25" wide x 9.00" long x 1.50" tall
Weight: 2.596
Language: English

Pete Smith is a Technical Architect and data warehouse specialist with a wide range of expertise from application analysis, design and development through to database design, administration and tuning. This experience covers 19 years in the IT industry, 14 of which are specifically on Oracle platforms and demonstrates a high degree of longevity and familiarity with the Oracle database server and associated products. Qualified to degree level, Pete has worked for many years as an independent Oracle consultant and, more recently, in a senior position as a Principal consultant with Oracle UK; Pete now works for a specialist UK IT consultancy.

Transient Objects
Programming with Objects
Introduction
Object-Oriented Design
Templates and the Standard Template Library
Objects and Secondary Memory
Recursion
Measures of Complexity
Chapter Summary
Exercises
Problems
References
Notes
Lists and Strings
Introduction
Basic List Operations
List Implementations
Lists and the STL
General Lists
List Applications
Basic String Operations
String Implementation
String Applications
Chapter Summary
Exercises
Problems
References
Notes
Sets
Introduction
Basic Set Operations
Implementation of Sets
Sets in the STL
Applications of Sets
Chapter Summary
Exercises
Problems
References
Notes
Stacks and Queues
Introduction
Stacks
Queues
Priority Queues
Stacks, Queues, and the STL
Chapter Summary
Exercises
Problems
Notes
Maps: Hash Tables
Introduction
Bucket Size
Packing Density
Hash Function
Overflow Resolution
Hash Table Implementations
Applications
Chapter Summary
Exercises
Problems
References
Notes
Maps: Binary Trees, Tries, and Ternary Trees
Introduction
Binary Search Trees
AVL Trees
Tries
Ternary Trees
Binary Tree Applications
Chapter Summary
Exercises
Problems
References
Notes
Graphs
Introduction
Basic Graph Operations
Graph Implementation
Graph Algorithms
Activity Networks
The Seven Bridges of Konigsburg
Planar Graphs
Chapter Summary
Exercises
Problems
References
Notes
Persistent Objects
Hardware Foundations of Persistent Objects
Introduction
Memory Reliability
Disks, RAID, and Cache Memories
File Systems
Chapter Summary
Exercises
Problems
References
Notes
Files and Objects
Introduction
Programming Language Interface
File Objects
Saving Transient Objects
Chapter Summary
Exercises
Problems
Notes
Sorting
Introduction
Internal Sorting
External Sorting
Chapter Summary
Exercises
Problems
References
Notes
Maps: Hash Files
Introduction
Hash Files
Table-Assisted Hashing
Fixed-Length Versus Extensible Files
Dynamic Hashing
Extendible Hashing
Chapter Summary
Exercises
Problems
References
Notes
Maps: File-Based Trees
Introduction
Static Indexes
Dynamic Indexes
Comparison of Static and Dynamic Indexes
Chapter Summary
Exercises
Problems
References
Notes
Multimaps: Secondary Key Retrievals
Introduction
Inverted Files
Grid Files
Chapter Summary
Exercises
Problems
References
Notes
Persistent Structures and Databases
Introduction
Selection of Persistent Structure
Comparison of Files and Databases
Object Databases
Chapter Summary
Exercises
Problems
References
Notes
Random Numbers and Data Generation
Single-Seed PNG
Multiseed PNG
Example Applications of Single-Seed PNG
Example 1: A Uniform Distribution
Example 2: Unique Integers
Example 3: Nonuniform Distribution
Example 4: Matching a Distribution
References
Data Normalization
Introduction
Update Anomalies
Running Example
First Normal Form (1NF)
Functional Dependencies
Second Normal Form (2NF)
Third Normal Form (3NF)
Boyce_Codd Normal Form
Fourth Normal Form (4NF)
Fifth Normal Form (5NF)
Summary
Exercises
Notes
Test of File Object
Glossary
Index