An Introduction to Data Structures and Algorithms - Rilegato

Storer, J.A.

 
9780817642532: An Introduction to Data Structures and Algorithms
Rilegato
ISBN 10: 0817642536 ISBN 13: 9780817642532
Casa editrice: Birkhauser Boston Inc, 2001

Sinossi

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 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, Algorithms Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Discrete Fourier Transform, Strings, Graphs, Parallel Models of Computation.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Recensione

"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

Contenuti

Preface * 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 (DFT) * 13. Parallel Computation * Appendix of Common Sums * Bibliography * Notation * Index

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Birkhauser Boston Inc
Data di pubblicazione
2001
Lingua
Inglese
ISBN 10 
0817642536
ISBN 13 
9780817642532
Rilegatura
Copertina rigida
Numero di pagine
616
Contatto del produttore
non disponibile
Persona responsabile
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Germania

Altre edizioni note dello stesso titolo

9781461266013: An Introduction to Data Structures and Algorithms

Edizione in evidenza

ISBN 10:  1461266017 ISBN 13:  9781461266013
Casa editrice: Springer, 2013
Brossura