C++ Plus Data Structures / Dale, Nell
| List Price: | |
Our Price: $74.65 | |
|
For Bulk orders
| |
|
Used Book Price: | |
| C++ Plus Data Structures / Dale, Nell | |
| Publisher: Jones & Bartlett Learning | |
| Availability:In stock. Usually ships within 3 to 4 days. | |
| Sales Rank: 44452 | |
|
Similar Books
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.
NEW & KEY FEATURES OF THE SIXTH EDITION:
• 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
Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to
.
No guarantees are made as to accuracy of prices and information.
NEW & KEY FEATURES OF THE SIXTH EDITION:
• 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
Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to
.No guarantees are made as to accuracy of prices and information.
