Data Structures and Program Design in C++ / Edition 1

Data Structures and Program Design in C++ / Edition 1

ISBN-10:
0137689950
ISBN-13:
9780137689958
Pub. Date:
09/22/1998
Publisher:
Prentice Hall
ISBN-10:
0137689950
ISBN-13:
9780137689958
Pub. Date:
09/22/1998
Publisher:
Prentice Hall
Data Structures and Program Design in C++ / Edition 1

Data Structures and Program Design in C++ / Edition 1

$196.6
Current price is , Original price is $196.6. You
$196.60 
  • SHIP THIS ITEM
    This item is available online through Marketplace sellers.
  • PICK UP IN STORE

    Your local store may have stock of this item.

$14.45 
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.

    • Condition: Good
    Note: Access code and/or supplemental material are not guaranteed to be included with used textbook.

Overview

Progressing from the concrete to the abstract — and using numerous, substantial case studies and sample programs — this book explores structured problem solving, data abstraction, software engineering principles, and the comparative analysis of algorithms as fundamental tools of program design. The book and all programs have been completely written from the Object-Oriented perspective. Uses the C++ programming language throughout. Briefly reviews the syntax of C++ and provides a brief introduction to the language. The book is native C++ making full use of C++ features and object-oriented programming. Discusses major principles of software engineering and applies them to large programming projects. Covers several more advanced, modern topics, e.g.: Splay trees, Red-black trees, Amortized algorithm analysis.


Product Details

ISBN-13: 9780137689958
Publisher: Prentice Hall
Publication date: 09/22/1998
Edition description: New Edition
Pages: 704
Product dimensions: 7.50(w) x 9.20(h) x 1.60(d)

Table of Contents

1. Programming Principles.

2. Introduction to Stacks.

3. Queues.

4. Linked Stacked and Queues.

5. Recursion.

6. Lists and Strings.

7. Searching.

8. Sorting.

9. Tables and Information Retrieval.

10. Binary Trees.

11. Multiway Trees.

12. Graphs.

13. Case Study: The Polish Notation.

Appendix A: Mathematical Methods.

Appendix B: Random Numbers.

Appendix C: Packages and Utility Functions.

Appendix D: Programming Precepts, Pointers, and Pitfalls.

Index.

From the B&N Reads Blog

Customer Reviews