|
Data Structures & Algorithms in Java 2nd Edition
Table of Contents
1. Object-Oriented Programming Using Java
2. Complexity Analysis
3. Linked Lists
4. Stacks and Queues
5. Recursion
6. Binary Trees
7. Multiway Trees
8. Graphs
9. Sorting
10. Hashing
11. Data Compression
12. Memory Management
Appendix A: Computing BIG-O
Appendix
B: NP-Completeness
Features
Applies material learned with a case study included in most chapters that illustrate a complete context in which certain algorithms and data structures can be used. These case studies were chosen from different areas of computer science such as interpreters, symbolic computation, and file processing.
Illustrates the practical importance of data structures with brief examples of Java code throughout the book. Theoretical analysis is equally important so the algorithms are integrated with analyses of efficiency.
Clarifies recursion topics through their presentation in context of the run-time stack.
Enhances students' knowledge of memory management, data compression, and string matching - topics rarely found in data structures texts.
|
