Includes index.

Ch. 1. Getting organized. Software engineering ; Object orientation ; Classes, objects, and applications ; Organizing classes ; Data structures ; Basic structuring mechanisms ; Comparing algorithms : big-O analysis -- Ch. 2. Abstract data types. Abstraction ; The StringLog ADT specification ; Array-based StringLog ADT implementation ; Software testing ; Introduction to linked lists ; Linked list StringLog ADT implementation ; Software design : identification of classes ; Case study : a trivia game -- Ch. 3. The stack ADT. Stacks ; Collection elements ; Exceptional situations ; Formal specification ; Array-based implementations ; Application : well-formed expressions ; Link-based implementation ; Case study : postfix expression evaluator -- Ch. 4. Recursion. Recursive definitions, algorithms, and programs ; The three questions ; Towers of Hanoi ; Counting blobs ; Recursive linked-list processing ; Removing recursion ; Deciding whether to use a recursive solution -- Ch. 5. The queue ADT. Queues ; Formal specification ; Array-based implementations ; Application : palindromes ; Application : the card game of War ; Link-based implementations ; Concurrency, interference, and synchronization ; Case study : average waiting time -- Ch. 6. The list ADT. Comparing objects revisited ; Lists ; Formal specification ; Array-based implementations ; Applications : poker, golf, and music ; The binary search algorithm ; Reference-based implementations ; Storing objects and structures in files -- Ch. 7. More lists. Circular linked lists ; Doubly linked lists ; Linked lists with headers and trailers ; A linked list as an array of nodes ; A specialized list ADT ; Case study : large integers -- Ch. 8. Binary search trees. Trees ; The logical level ; The application level ; The implementation level : basics ; Iterative versus recursive method implementations ; The implementation level : remaining operations ; Comparing binary search tree and linear lists ; Balancing a binary search tree ; A nonlinked representation of binary trees ; Case study : word frequency generator -- Ch. 9. Priority queues. Priority queues ; Heaps ; Introduction to graphs ; Formal specification of graph ADT ; Implementations of graphs ; Graph applications -- Ch. 10. Sorting and searching algorithms. Sorting ; Simple sorts ; O(N log₂N) sorts ; More sorting considerations ; Searching ; Hashing -- Appendix A. Java reserved words -- Appendix B. Operator precedence -- Appendix C. Primitive data types -- Appendix D. ASCII subset of Unicode -- Appendix E. Application of programmer interfaces for the Java classes and interfaces used in this book.

1 2