Skip to main content
SpringerLink
Log in
Birkhäuser

An Introduction to Data Structures and Algorithms

  • Textbook
  • © 2002

Overview

Authors:
  1. James A. Storer

    1. Department of Computer Science, Brandeis University, Waltham, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Pages i-xvii
    Download chapter PDF

  2. RAM Model

    • James A. Storer
    Pages 1-57

  3. Lists

    • James A. Storer
    Pages 59-85

  4. Induction and Recursion

    • James A. Storer
    Pages 87-125

  5. Trees

    • James A. Storer
    Pages 127-160

  6. Algorithm Design

    • James A. Storer
    Pages 161-201

  7. Hashing

    • James A. Storer
    Pages 203-222

  8. Heaps

    • James A. Storer
    Pages 223-236

  9. Balanced Trees

    • James A. Storer
    Pages 237-268

  10. Sets Over a Small Universe

    • James A. Storer
    Pages 269-288

  11. Graphs

    • James A. Storer
    Pages 289-353

  12. Strings

    • James A. Storer
    Pages 355-420

  13. Discrete Fourier Transform

    • James A. Storer
    Pages 421-469

  14. Parallel Computation

    • James A. Storer
    Pages 471-541

  15. Back Matter

    Pages 543-599
    Download chapter PDF
Back to top

Keywords

About this book

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

Reviews

"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 provided in pseudocode, so that students can implement the algorithms in a programming language of their choice. The book addresses basic as well as advanced algorithms in data structures, with introductory but adequate material about parallel computing models also provided... At the end of each chapter, there are sample exercises with solutions that help students to test their understanding of the book. There are also unsolved exercises that can be of use to instructors for course assignments... Each chapter also includes notes at the end, providing a good summary of the topics covered, which is very useful for students taking the course. The author has done a commendable job in outlining various algorithms for a problem, and also in comparing their merits... [The] approach of the book is easy to understand for students with a strong mathematical background."

—ACM Computing Reviews

Authors and Affiliations

  • Department of Computer Science, Brandeis University, Waltham, USA

    James A. Storer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation