An Introduction to Data Structures and Algorithms

Data structures and algorithms are presented at the college level in a way that is unique in content and presentation from current available texts. A highly accessible format presents algorithms with one page displays that will appeal to both students and teachers of computer science. The thirteen chapters systematically and comprehensively cover Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Discrete Fourier Transform, Strings, Graphs, Parallel Computation.

"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

Autorentext
Data structures and algorithms are presented at the college level in a
way that is unique in content and presentation from current available
texts. A highly accessible format presents algorithms with one page
displays that will appeal to both students and teachers of computer
science. The thirteen chapters systematically and comprehensively
cover Models of Computation, Lists, Induction and Recursion, Trees,
Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small
Universe, Discrete Fourier Transform, Strings, Graphs, Parallel
Computation.

Zusammenfassung

• 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).

  Inhalt

  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.