gogogo
Syndetics cover image
Image from Syndetics

Data structures & algorithm analysis in C++ / Clifford A. Shaffer.

By: Contributor(s): Material type: TextTextSeries: Dover books on mathematicsPublication details: Mineola, NY : Dover Publications, ©2011.Edition: 3rd ed., Dover edDescription: xix, 594 pages : illustrations ; 26 cmISBN:
  • 9780486485829
  • 048648582X
Other title:
  • Data structures and algorithm analysis in C++
Subject(s): DDC classification:
  • 005.73 SHA
Contents:
Data structures and algorithms -- Mathematical preliminaries -- algorithm analysis -- Lists, stacks, and queues -- Binary trees -- Non-binary trees -- Internal sorting -- File processing and external sorting -- Searching -- Indexing -- Graphs -- Lists and arrays revisited -- Advanced tree structures -- Analysis techniques -- Lower bounds -- Patterns of algorithms -- Limits to computation -- Utility functions.
Summary: A comprehensive treatment that focuses on how to create efficient data structures and algorithms, this text helps readers understand how to select or design the data structure that will best solve a specific problem. This edition uses Microsoft\'s C++ as the programming language and is suitable for second-year data structure courses and computer science courses in algorithmic analysis-- Provided by publisher.
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Standard Loan Moylish Library Main Collection 005.73 SHA (Browse shelf(Opens below)) 1 Available 39002100625541

Enhanced descriptions from Syndetics:

With its focus on creating efficient data structures and algorithms, this comprehensive text helps readers understand how to select or design the tools that will best solve specific problems. It uses Microsoft C++ as the programming language and is suitable for second-year data structure courses and computer science courses in algorithm analysis.
Techniques for representing data are presented within the context of assessing costs and benefits, promoting an understanding of the principles of algorithm analysis and the effects of a chosen physical medium. The text also explores tradeoff issues, familiarizes readers with the most commonly used data structures and their algorithms, and discusses matching appropriate data structures to applications. The author offers explicit coverage of design patterns encountered in the course of programming the book's basic data structures and algorithms. Numerous examples appear throughout the text.

Revised edition of: A practical introduction to data structures and algorithm analysis / Clifford A. Shaffer. 2001.

Includes bibliographical references and index.

Data structures and algorithms -- Mathematical preliminaries -- algorithm analysis -- Lists, stacks, and queues -- Binary trees -- Non-binary trees -- Internal sorting -- File processing and external sorting -- Searching -- Indexing -- Graphs -- Lists and arrays revisited -- Advanced tree structures -- Analysis techniques -- Lower bounds -- Patterns of algorithms -- Limits to computation -- Utility functions.

A comprehensive treatment that focuses on how to create efficient data structures and algorithms, this text helps readers understand how to select or design the data structure that will best solve a specific problem. This edition uses Microsoft\'s C++ as the programming language and is suitable for second-year data structure courses and computer science courses in algorithmic analysis-- Provided by publisher.

Table of contents provided by Syndetics

  • Preface
  • I Preliminaries
  • 1 Data Structures and Algorithms
  • 2 Mathematical Preliminaries
  • 3 Algorithm Analysis
  • II Fundamental Data Structures
  • 4 Lists, Stacks, and Queues
  • 5 Binary Trees
  • 6 Non-Binary Trees
  • III Sorting and Searching
  • 7 Internal Sorting
  • 8 File Processing and External Sorting
  • 9 Searching
  • 10 Indexing
  • IV Advanced Data Structures
  • 11 Graphs
  • 12 Lists and Arrays Revisited
  • 13 Advanced Tree Structures
  • V Theory of Algorithms
  • 14 Analysis Techniques
  • 15 Lower Bounds
  • 16 Patterns of Algorithms
  • 17 Limits to Computation
  • Bibliography
  • Index

Author notes provided by Syndetics

Clifford Shaffer is a Computer Science Professor at Virginia Commonwealth University (Virginia Tech).

Powered by Koha