An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science) [Hardcover]

J.A. Storer (Author), John C. Cherniavsky (Editor)

Book Description

ISBN-10: 0817642536 | ISBN-13: 978-0817642532 | Publication Date: November 9, 2001 | Edition: 1

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

Editorial Reviews

Review

"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

About the Author

James A. Storer received his B.A. in Mathematics and Computer Science from Cornell University, his M.A. in Computer Science from Princeton University, and his Ph.D. in Computer Science from Princeton University. After leaving Princeton he was a researcher at Bell Laboratories in Murray Hill, New Jersey. He then came to Brandeis University, where he is currently Chair of the Computer Science Department and member of the Brandeis Center for Complex Systems.

Product Details

• Hardcover: 624 pages
• Publisher: Birkhäuser Boston; 1 edition (November 9, 2001)
• Language: English
• ISBN-10: 0817642536
• ISBN-13: 978-0817642532
• Product Dimensions: 9.9 x 7 x 1.4 inches
• Shipping Weight: 2.9 pounds (View shipping rates and policies)
• Average Customer Review: 3.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #527,424 in Books (See Top 100 in Books)
  • #59 in Books > Computers & Technology > Programming > Algorithms > Data Structures

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

16 of 19 people found the following review helpful:

5.0 out of 5 stars For Serious Developers, November 28, 2003

By 

W Boudville (Terra, Sol 3) - See all my reviews
(VINE VOICE)    (TOP 1000 REVIEWER)    (HALL OF FAME REVIEWER)    (REAL NAME)   

This review is from: An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer Science) (Hardcover)

If you have cut your teeth on Donald Knuth's classic three volumes, "The Art of Computer Programming", and you want more detail, at a similar level of complexity, then consider Storer's book.

It delves into lists, recursion, trees, graphs, heaps and sets. Like Knuth, Storer thoughtfully supplies an extensive list of questions at the end of each chapter that will greatly deepen your appreciation of the field if you tackle them. Ok, he doesn't give answers, but think of that as greater incentive on your part to solve them. There are almost 400 questions in the book.

The teaching style is similar to Knuth, in that it has all the rigour needed by an algorithm designer like yourself, without drowning you in epsilon-delta ultra rigour like a pure maths text.

Note that the only code fragments are in pseudocode. This should not be a problem for you. I am assuming you are experienced enough that what you need is understanding of an algorithm, and that manually converting it to code is straightforward and a purely secondary issue.

The take home message is that this is excellent for anyone doing serious programming.

1.0 out of 5 stars not an excellent book, October 23, 2011

By 

A data structure lecturer - See all my reviews

This review is from: Introduction to Data Structures and Algorithms (Hardcover)

I selected this book as the textbook for my course of data structure, and this book has given me a lot of troubles. Firstly, the pseudo code give by the book is sometimes wrong and the descriptions about the data structures are inconsistent. For example, if you have this book, turn to the page containing the merge sort pseudo code and give it a try. As another example, go to the tree section and have a detailed look at descriptions of the delete-min operations of a binary search tree, you will find the defects by yourself. Secondly, the language the author used are not reader-friendly, especially not beginner friendly. To some extent, it scared away my students. They kept telling me that "this book is difficult to read". I should have selected another book on data structure.