Data Structures and Algorithms in C++ / Edition 2

Paperback (Print)
Rent
Rent from BN.com
$26.35
(Save 83%)
Est. Return Date: 11/01/2014
Used and New from Other Sellers
Used and New from Other Sellers
from $92.30
Usually ships in 1-2 business days
(Save 41%)
Other sellers (Paperback)
  • All (13) from $92.30   
  • New (7) from $92.30   
  • Used (6) from $95.95   

More About This Textbook

Overview

An updated, innovative approach to data structures and algorithms

Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and algorithms in C++.

The unparalleled author team incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms.

  • Offers a unique multimedia format for learning the fundamentals of data structures and algorithms
  • Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design
  • Provides clear approaches for developing programs
  • Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts

Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms.

Read More Show Less

Product Details

  • ISBN-13: 9780470383278
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 2/22/2011
  • Edition description: New Edition
  • Edition number: 2
  • Pages: 744
  • Sales rank: 261,968
  • Product dimensions: 7.50 (w) x 9.10 (h) x 1.10 (d)

Table of Contents

1. A C++ Primer.

1.1 Basic C++ Programming Elements.

1.2 Expressions.

1.3 Control Flow.

1.4 Functions.

1.5 Classes.

1.6 C++ Program and File Organization.

1.7 Writing a C++ Program.

1.8 Exercises.

2. Object-Oriented Design.

2.1 Goals, Principles, and Patterns.

2.2 Inheritance and Polymorphism.

2.3 Templates.

2.4 Exceptions.

2.5 Exercises.

3. Arrays, Linked Lists, and Recursion.

3.1 Using Arrays.

3.2 Singly Linked Lists.

3.3 Doubly Linked Lists.

3.4 Circularly Linked and List Reversal.

3.5 Recursion.

3.6 Exercises.

4. Analysis Tools.

4.1 The Seven Functions Used in This Book.

4.2 Analysis of Algorithms.

4.3 Simple Justification Techniques.

4.4 Exercises.

5. Stacks, Queues, and Deques.

5.1 Stacks.

5.2 Queues.

5.3 Double-Ended Queues.

5.4 Exercises.

6. List and Iterator ADTs.

6.1 Vectors.

6.2 Lists.

6.3 Sequences.

6.4 Case Study: Bubble-Sort on a Sequence.

6.5 Exercises.

7. Trees.

7.1 General Trees.

7.2 Tree Traversal Algorithms.

7.3 Binary Trees.

7.4 Exercises.

8. Heaps and Priority Queues.

8.1 The Priority Queue Abstract Data Type.

8.2 Implementing a Priority Queue with a List.

8.3 Heaps.

8.4 Adaptable Priority Queues.

8.5 Exercises.

9. Hash Tables, Maps, and Skip Lists.

9.1 Maps.

9.2 Hash Tables.

9.3 Ordered Maps.

9.4 Skip Lists.

9.5 Dictionaries.

9.6 Exercises.

10. Search Trees.

10.1 Binary Search Trees.

10.2 AVL Trees.

10.3 Splay Trees.

10.4 (2,4) Trees.

10.5 Red-Black Trees.

10.6 Exercises.

11. Sorting, Sets, and Selection.

11.1 Merge-Sort.

11.2 Quick-Sort.

11.3 Studying Sorting through and Algorithmic Lens.

11.4 Sets and Union/Find Structures.

11.5 Selection.

11.6 Exercises.

12. Strings and Dynamic Programming.

12.1 String Operations.

12.2 Dynamic Programming.

12.3 Pattern Matching Algorithms.

12.4 Text Compression and the Greedy Method.

12.5 Tries.

12.6 Exercises.

13. Graph Algorithms.

13.1 Graphs.

13.2 Data Structures for Graphs.

13.3 Graph Traversals.

13.4 Directed Graphs.

13.5 Shortest Paths.

13.6 Minimum Spanning Trees.

13.7 Exercises.

14. Memory Management and B-Trees.

14.1 Memory Management.

14.2 External Memory and Caching.

14.3 External Searching and B-Trees.

14.4 External-Memory Sorting.

14.5 Exercises.

A Useful Mathematical Facts.

Bibliography.

Index. 

Read More Show Less

Customer Reviews

Average Rating 4
( 1 )
Rating Distribution

5 Star

(0)

4 Star

(1)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted April 7, 2012

    No text was provided for this review.

Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)