Algorithms and data structures lie at the heart of computer science, and are essential tools for every practising programmer. This book provides an in-depth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness and analysis required for understanding them. Beginning with coverage of techniques followed by the major application areas of lists, trees, symbol tables, priority queues, sorting, disjoint sets, and graph algorithms. The theory is then completed with a closing chapter on lower bounds.
Auflage
Sprache
Verlagsort
Verlagsgruppe
Pearson Education Limited
Zielgruppe
Maße
Höhe: 235 mm
Breite: 154 mm
Dicke: 19 mm
Gewicht
ISBN-13
978-0-201-40374-9 (9780201403749)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Jeffrey H. Kingston is a senior lecturer in the Basser Department of Computer Science at the University of Sydney, Australia. He has published correctness proofs and analyses of a variety of data structures ans algorithms; his other research interests include document formatting, computerized timetable construction and computer science curriculum design.
0201403749AB04062001
Preface.
1. Algorithm Correctness.
2. Analysis of Algorithms.
3. Data Abstraction.
4. Algorithm Design.
5. Lists, Stacks, and Queues.
6. Trees.
7. Symbol Tables.
8. Priority Queues.
9. Sorting.
10. Disjoint Sets.
11. Graphs.
12. Five Classic Graph Problems.
13. Lower Bounds.
Appendix A. Reading Eiffel.
Appendix B. Recommended Reading.
