An Introduction to Data Structures and Algorithms
Author:   J.A. Storer ,  John C. Cherniavsky
Publisher:   Birkhauser Boston Inc
Edition:   2002 ed.
ISBN:  

9780817642532


Pages:   599
Publication Date:   09 November 2001
Format:   Hardback
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Our Price $261.36 Quantity:  
Add to Cart

Share |

An Introduction to Data Structures and Algorithms


Add your own review!

Overview

Full Product Details

Author:   J.A. Storer ,  John C. Cherniavsky
Publisher:   Birkhauser Boston Inc
Imprint:   Birkhauser Boston Inc
Edition:   2002 ed.
Dimensions:   Width: 17.80cm , Height: 3.30cm , Length: 25.40cm
Weight:   1.310kg
ISBN:  

9780817642532


ISBN 10:   0817642536
Pages:   599
Publication Date:   09 November 2001
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Table of 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.

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. <p>a ACM Computing 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


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now