Notre Dame London: Fischer Hall Library
Image from Google Jackets

Data structures and algorithms in C++ / Michael T. Goodrich, Roberto Tamassia, David M. Mount.

By: Goodrich, Michael TContributor(s): Tamassia, Roberto, 1960- | Mount, David MPublication details: Hoboken, N.J. : Wiley, c2011. Edition: 2nd edDescription: xxii, 714 p. : ill. ; 24 cmISBN: 9780470383278 (pbk.)Subject(s): C++ (Computer program language) | Data structures (Computer science) | Computer algorithms | COMPUTERS / Programming Languages / C++DDC classification: 005.1 LOC classification: QA76.73.C153 | G63 2011Other classification: COM051070 Online resources: Cover image
Contents:
Machine generated contents note: -- Chapter 1 - Basic C++ Programming. -- Chapter 2 - Object-Oriented Design. -- Chapter 3 - Analysis Tools. -- Chapter 4 - Stacks, Queues, and Recursion. -- Chapter 5 - Vectors, Lists, and Sequences. -- Chapter 6 - Trees. -- Chapter 7 - Priority Queues. -- Chapter 8 - Dictionaries. -- Chapter 9 - Search Trees. -- Chapter 10 - Sorting, Sets, and Selection. -- Chapter 11 - Text Processing. -- Chapter 12 - Graphs. -- Appendix: Useful Mathematical Facts.
Summary: "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."-- Provided by publisher.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Class number Status Date due Barcode Item reservations
Textbook Textbook Fischer Hall Library
Textbook Store
QA76.73.C153 G63 2011 (Browse shelf(Opens below)) Available T007659
Book-Reference Book-Reference Fischer Hall Library
Reference
QA76.73. C153G63 2011 (Browse shelf(Opens below)) Not for loan B012308
Total reservations: 0

Includes bibliographical references and index.

"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."-- Provided by publisher.

Includes bibliographical references and index.

Machine generated contents note: -- Chapter 1 - Basic C++ Programming. -- Chapter 2 - Object-Oriented Design. -- Chapter 3 - Analysis Tools. -- Chapter 4 - Stacks, Queues, and Recursion. -- Chapter 5 - Vectors, Lists, and Sequences. -- Chapter 6 - Trees. -- Chapter 7 - Priority Queues. -- Chapter 8 - Dictionaries. -- Chapter 9 - Search Trees. -- Chapter 10 - Sorting, Sets, and Selection. -- Chapter 11 - Text Processing. -- Chapter 12 - Graphs. -- Appendix: Useful Mathematical Facts.