Data Structures and Algorithms in C++ 2nd ed - M. Goodrich, et al., (Wiley, 2011) BBS

                   Data Structure and Algorithm in c++ second edition by M. Goodish

Description:

This second edition of Data Structures and Algorithms in C++ is designed to provide an introduction to data structures and algorithms, including their design, analysis, and implementation. The authors offer an introduction to object-oriented design with C++ and design patterns, including the use of class inheritance and generic programming through class and function templates, and retain a consistent object-oriented viewpoint throughout the book.

This is a “sister” book to Goodrich & Tamassia’s Data Structures and Algorithms in Java, but uses C++ as the basis language instead of Java. This C++ version retains the same pedagogical approach and general structure as the Java version so schools that teach data structures in both C++ and Java can share the same core syllabus.
In terms of curricula based on the IEEE/ACM 2001 Computing Curriculum, this book is appropriate for use in the courses CS102 (I/O/B versions), CS103 (I/O/B versions), CS111 (A version), and CS112 (A/I/O/F/H versions).
We discuss its use for such courses in more detail later in this preface.The major changes in  
The second edition are the following:

• We added more examples of data structure and algorithm analysis.
• We enhanced consistency with the C++ Standard Template Library (STL).
• We incorporated STL data structures into many of our data structures.
• We added a chapter on arrays, linked lists, and iterators (Chapter 3).
• We added a chapter on memory management and B-trees (Chapter 14).
• We enhanced the discussion of algorithmic design techniques, like dynamicprogramming and the greedy method.
• We simplified and reorganized the presentation of code fragments.
• We have introduced STL-style iterators into our container classes, and havepresented C++ implementations for these iterators, even for complex struc-tures such as hash tables and binary search trees.
• We have modified our priority-queue interface to use STL-style comparator objects.
• We expanded and revised exercises, continuing our approach of dividingthem into reinforcement, creativity, and project exercises.This book is related to the following books:
• M.T. Goodrich and R. Tamassia,
• Data Structures and Algorithms in Java
• ,John Wiley & Sons, Inc. This book has a similar overall structure to thepresent book, but uses Java as the underlying language (with some modest,but necessary pedagogical differences required by this approach).
• M.T. Goodrich and R. Tamassia,
• Algorithm Design: Foundations, Analysis,and Internet Examples
• , John Wiley & Sons, Inc. Thisis atextbook for amoreadvanced algorithms and data structures course, such as CS210 (T/W/C/Sversions) in the IEEE/ACM 2001 curriculum.While this book retains the same pedagogical approach and general structureas
• Data Structures and Algorithms in Java
• , the code fragments have been com-pletely redesigned. We have been careful to make full use of C++’s capabilities anddesign code in a manner that is consistent with modern C++ usage. In particular,whenever appropriate, we make extensive use of C++ elements that are not part of Java, including the C++ Standard Template Library (STL), C++ memory allocation

About The Author:

Michael Goodrich received his Ph.D. in computer science from Purdue University in 1987. He is currently a professor in the Department of Computer Science at University of California, Irvine. Previously, he was a professor at Johns Hopkins University. He is an editor for the International Journal of Computational Geometry & Applications and Journal of Graph Algorithms and Applications.
Roberto Tamassia received his Ph.D. in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign in 1988. He is currently a professor in the Department of Computer Science at Brown University. He is editor-in-chief for the Journal of Graph Algorithms and Applications and an editor for Computational Geometry: Theory and Applications. He previously served on the editorial board of IEEE Transactions on Computers.

Download

Size: 52 kt