This guy does a great job of balancing tech with down to earth understanding. I used this book in my second tier programming class (OOP data structures) and it was the first book that I could really dive into, read his text and then take the code apart and understand it. He has very nice code exampl
Data structures and algorithms in Java
โ Scribed by Drake, Peter
- Publisher
- Prentice Hall
- Year
- 2008
- Tongue
- English
- Leaves
- 583
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Note: Each chapter concludes with a summary, vocabulary, problems, and projects. Part I: Object-Oriented Programming1 Encapsulation. Software Development. Classes and Objects. Using Objects. 2 Polymorphism. Reference Types. Arrays. Interfaces. Overloading. 3 Inheritance. Extending a Class. The Object Class. Packages and Access Levels. Part II: Linear Structures 4 Stacks and Queues. The Stack Interface. The Call Stack. Exceptions. The Queue Interface.5 Array-Based Structures. Shrinking and Stretching Arrays. Implementing Stacks and Queues. The List Interface. Iterators. The Java Collections Framework: A First Look. 6 Linked Structures. List Nodes. Stacks and Queues. The LinkedList Class. The Java Collections Framework Revisited Part III: Algorithms 7 Analysis of Algorithms. Timing. Asymptotic Notation. Counting Steps. Best, Worst, and Average Case. Amortized Analysis. 8 Searching and Sorting. Linear Search. Binary Search. Insertion Sort. The Comparable Interface. Sorting Linked Lists. 9 Recursion. Thinking Recursively. Analyzing Recursive Algorithms. Merge Sort. Quicksort. Avoiding Recursion. Part IV: Trees and Sets 10 Trees. Binary Trees. Tree Traversal. General Trees 11 Sets. The Set Interface. Ordered Lists. Binary Search Trees. Hash Tables. The Java Collections Framework Again. Part V: Advanced Topics 12 Advanced Linear Structures. Bit Vectors. Sparse Arrays. Contiguous Representation of Multidimensional Arrays. Advanced Searching and Sorting 13 Strings. Strings and StringBuilders. String Matching. 14 Advanced Trees. Heaps. Disjoint Set Clusters. Digital Search Trees. Red-Black Trees. 15 Graphs. Terminology. Representation. Graph Traversal. Topological Sorting. Shortest Paths. Minimum Spanning Trees. 16 Memory Management. Explicit Memory Management. Automatic Memory Management. Review of Java Unified Modeling Language Summation Formulae Further Reading
๐ SIMILAR VOLUMES
I must echo the concerns that other students have presented with respect to this book. It significantly detracted from my learning of data structures in undergraduate CS. The more that I wanted to learn data structures, the more confused I became when I attempted to read the book and implement/modif
Using the Java programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book
<b></b><b>KEY BENEFITS:</b>This new book provides a concise and engaging introduction to Java and object-oriented programming with an abundance of original examples, use of Unified Modeling Language throughout, and coverage of the new Java 1.5. Addressing critical concepts up front, the book's five-
<p><i>Data Structures and Algorithms in Java, Second Edition</i>is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includ
This new book provides a concise and engaging introduction to Java and object-oriented programming with an abundance of original examples, use of Unified Modeling Language throughout, and coverage of the new Java 1.5. Addressing critical concepts up front, the book's five-part structure covers objec