skip to content
An Introduction to Data Structures and Algorithms Preview this item
ClosePreview this item
Checking...

An Introduction to Data Structures and Algorithms

Author: James A Storer
Publisher: Boston, MA : Birkhäuser Boston : Imprint : Birkhäuser, 2002.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: James A Storer
ISBN: 9781461200758 146120075X
OCLC Number: 853262975
Description: 1 online resource (xvii, 599 pages)
Contents: 1. RAM Model --
2. Lists --
3. Induction and Recursion --
4. Trees --
5. Algorithm Design --
6. Hashing --
7. Heaps --
8. Balanced Trees --
9. Sets Over a Small Universe --
10. Graphs --
11. Strings --
12. Discrete Fourier Transform --
13. Parallel Computation --
Appendix: Common Sums --
A. Approximating Sums with Integrals --
B. Arithmetic Sum --
I. Harmonic Sum --
J. Sums of Inverse Powers --
Notation.
Responsibility: by James A. Storer.

Abstract:

* Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"Intended as a teaching aid for college and graduate-level courses on data structures, the material in this book has been aligned to support the lecture style. All the algorithms in the book are Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/853262975> # An Introduction to Data Structures and Algorithms
    a schema:Book, schema:CreativeWork, schema:MediaObject ;
   library:oclcnum "853262975" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/144760119#Place/boston_ma> ; # Boston, MA
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:about <http://id.worldcat.org/fast/872527> ; # Computer software
   schema:about <http://id.worldcat.org/fast/887935> ; # Data encryption (Computer science)
   schema:about <http://dewey.info/class/005.82/e23/> ;
   schema:bookFormat schema:EBook ;
   schema:creator <http://viaf.org/viaf/46848871> ; # James A. Storer
   schema:datePublished "2002" ;
   schema:description "Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel."@en ;
   schema:description "1. RAM Model -- 2. Lists -- 3. Induction and Recursion -- 4. Trees -- 5. Algorithm Design -- 6. Hashing -- 7. Heaps -- 8. Balanced Trees -- 9. Sets Over a Small Universe -- 10. Graphs -- 11. Strings -- 12. Discrete Fourier Transform -- 13. Parallel Computation -- Appendix: Common Sums -- A. Approximating Sums with Integrals -- B. Arithmetic Sum -- I. Harmonic Sum -- J. Sums of Inverse Powers -- Notation."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/144760119> ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isSimilarTo <http://worldcat.org/entity/work/data/144760119#CreativeWork/> ;
   schema:name "An Introduction to Data Structures and Algorithms"@en ;
   schema:productID "853262975" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/853262975#PublicationEvent/boston_ma_birkhauser_boston_imprint_birkhauser_2002> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/144760119#Agent/birkhauser> ; # Birkhäuser
   schema:publisher <http://experiment.worldcat.org/entity/work/data/144760119#Agent/imprint> ; # Imprint
   schema:publisher <http://experiment.worldcat.org/entity/work/data/144760119#Agent/birkhauser_boston> ; # Birkhäuser Boston
   schema:url <http://dx.doi.org/10.1007/978-1-4612-0075-8> ;
   schema:url <http://link.springer.com/10.1007/978-1-4612-0075-8> ;
   schema:url <https://link.springer.com/openurl?genre=book&isbn=978-0-8176-4253-2> ;
   schema:workExample <http://dx.doi.org/10.1007/978-1-4612-0075-8> ;
   schema:workExample <http://worldcat.org/isbn/9781461200758> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/853262975> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/144760119#Agent/birkhauser_boston> # Birkhäuser Boston
    a bgn:Agent ;
   schema:name "Birkhäuser Boston" ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
   schema:name "Computer science"@en ;
    .

<http://id.worldcat.org/fast/872527> # Computer software
    a schema:Intangible ;
   schema:name "Computer software"@en ;
    .

<http://id.worldcat.org/fast/887935> # Data encryption (Computer science)
    a schema:Intangible ;
   schema:name "Data encryption (Computer science)"@en ;
    .

<http://viaf.org/viaf/46848871> # James A. Storer
    a schema:Person ;
   schema:familyName "Storer" ;
   schema:givenName "James A." ;
   schema:name "James A. Storer" ;
    .

<http://worldcat.org/entity/work/data/144760119#CreativeWork/>
    a schema:CreativeWork ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/853262975> ; # An Introduction to Data Structures and Algorithms
    .

<http://worldcat.org/isbn/9781461200758>
    a schema:ProductModel ;
   schema:isbn "146120075X" ;
   schema:isbn "9781461200758" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.