## Find a copy online

### Links to this item

## Find a copy in the library

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:

## 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 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 Read more...

*User-contributed reviews*