You'll get a bound printed text.
Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.
As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.
Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.
Table of contents
- Chapter 1 Introduction
- Chapter 2 Algorithm Analysis
- Chapter 3 Lists, Stacks, and Queues
- Chapter 4 Trees
- Chapter 5 Hashing
- Chapter 6 Priority Queues (Heaps)
- Chapter 7 Sorting
- Chapter 8 The Disjoint Set Class
- Chapter 9 Graph Algorithms
- Chapter 10 Algorithm Design Techniques
- Chapter 11 Amortized Analysis
- Chapter 12 Advanced Data Structures and Implementation
All the material you need to teach your courses.Discover teaching material
Published by Pearson (November 18th 2011) - Copyright © 2012