Data Structures and Problem Solving Using C++ (2nd Edition) [Paperback]

Mark A. Weiss (Author)

Book Description

ISBN-10: 020161250X | ISBN-13: 978-0201612509 | Publication Date: December 3, 1999 | Edition: 2

Data Structures and Problem Solving Using C++ provides a practical introduction to data structures and algorithms from the viewpoint of abstract thinking and problem solving, as well as the use of C++. It is a complete revision of Weiss' successful CS2 book Algorithms, Data Structures, and Problem Solving with C++. The most unique aspect of this text is the clear separation of the interface and implementation. C++ allows the programmer to write the interface and implementation separately, to place them in separate files and compile separately, and to hide the implementation details. This book goes a step further: the interface and implementation are discussed in separate parts of the book. Part I (Objects and C++), Part II (Algorithms and Building Blocks), and Part III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, but implementation of data structures is not shown until Part IV (Implementations). This separation of interface and implementation promotes abstract thinking. Class interfaces are written and used before the implementation is known, forcing the reader to think about the functionality and potential efficiency of the various data structures (e.g., hash tables are written well before the hash table is implemented). Throughout the book, Weiss has included the latest features of the C++ programming language, including a more prevalent use of the Standard Template Library (STL).

Editorial Reviews

From the Back Cover

Data Structures and Problem Solving Using C++ provides a practical introduction to data structures and algorithms from the viewpoint of abstract thinking and problem solving, as well as the use of C++. It is a complete revision of Weissi successful CS2 book Algorithms, Data Structures, and Problem Solving with C++.

The most unique aspect of this text is the clear separation of the interface and implementation. C++ allows the programmer to write the interface and implementation separately, to place them in separate files and compile separately, and to hide the implementation details. This book goes a step further: the interface and implementation are discussed in separate parts of the book. Part I (Objects and C++), Part II (Algorithms and Building Blocks), and Part III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, but implementation of data structures is not shown until Part IV (Implementations). This separation of interface and implementation promotes abstract thinking. Class interfaces are written and used before the implementation is known, forcing the reader to think about the functionality and potential efficiency of the various data structures (e.g., hash tables are written well before the hash table is implemented).

Throughout the book, Weiss has included the latest features of the C++ programming language, including a more prevalent use of the Standard Template Library (STL).

Features

• Promotes abstract thinking by separating the interface and implementation of the data structures into different parts of the book
• All code is completely rewritten and tested for compatibility with a wide range of current compilers
• Revised material makes use of the STL whenever appropriate
• Rewritten material on inheritance simplifies the initial presentation and provides the C++ details that are important for advanced uses
• Includes a new chapter on Patterns
• Provides new material on templates, vectors, and push_back
• Illustrates both the generic interfaces and STL interfaces of data structures
• Generic data structures such as linked lists classes, search tree and hash table classes, priority_queue, and disjoint sets class are rewritten to be much simpler and cleaner
• A simplified STL implementation is illustrated at the end of the chapters in Part IV, including vector, list, stack, queue, set, map, and priority_queue

020161250XB04062001

About the Author

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.

020161250XAB04062001

Product Details

• Paperback: 879 pages
• Publisher: Addison Wesley; 2 edition (December 3, 1999)
• Language: English
• ISBN-10: 020161250X
• ISBN-13: 978-0201612509
• Product Dimensions: 9.5 x 7.6 x 1.4 inches
• Shipping Weight: 3.6 pounds (View shipping rates and policies)
• Average Customer Review: 3.2 out of 5 stars  See all reviews (14 customer reviews)
• Amazon Best Sellers Rank: #159,281 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

12 of 12 people found the following review helpful:

5.0 out of 5 stars Data Structure & Algorithms Using "Real" C++, June 5, 2000

By 

Rawitat Pulam - See all my reviews

This review is from: Data Structures and Problem Solving Using C++ (2nd Edition) (Paperback)

This book is definitely the best from Mark Weiss yet. The explainations about Data structures and algorithms are very good and not-so-academic as in his other book (named "Data Structures & Algorithm Analysis in C++", which is also very good one).

I found that the books about Data structures & algorithm are always given a not-so-good review, because it doesn't show enough code example or for being too academic. However, this one really deserved 5 stars from me.

The code examples are very good and easy-to-understand for any intermediate C++ programmer (and, of course, for any advenced C++ programmer). So, you can easily use this book for self-study (a lot of people said that his previous book, the one I mentioned above, doesn't suit for self-study, dued to being too-academic). And moreover, the code in this book is true to its name "using C++".

All codes examples are written in real C++, no C-style code fragment here! And with the ability of the Standard Template Library (not all example, only the suitable one). For example : the STL's priority_queue container class was used in Dijkstra's shortest path algorithm, and that is the way it should be implement.

Last word I wish to say about this book is, "It is clearly one of the best book on Data Structures, Algorithms, C++ and How-To-Use C++ I've read so far."

Thank you, Mr.Weiss. Keep up a good work. I hope this one will get even better in its next edition.

2 of 3 people found the following review helpful:

5.0 out of 5 stars Excellent book on Data Structures, May 31, 2001

By 

"gillsurjeet" (Ann Arbor, MI USA) - See all my reviews

This review is from: Data Structures and Problem Solving Using C++ (2nd Edition) (Paperback)

I found this book is well organised, covers every topic of Data Structures (beginner to advance level) in detail, and with clean implementation of each structure using C++, which is required for Computer Science students. Author gave pretty good know how to implement theortical ideas into practical and also discuss the application of each structure in the real world.

5.0 out of 5 stars the used book, September 25, 2011

By 

ed - See all my reviews

Amazon Verified Purchase

This review is from: Data Structures and Problem Solving Using C++ (2nd Edition) (Paperback)

the used book still can use now with some damage on the surface, and it delivered on time and I am satisfy with the book, still don't know the in side of the book