Data Structures and Problem Solving Using Java / Edition 2by Mark Weiss
Pub. Date: 08/01/1901
Publisher: Addison Wesley
B> Data Structures and Problem Solving Using Java, Second Edition, provides a practical introduction to data structures and algorithms from the perspective of abstract thinking and problem solving, as well as the use of Java. Experienced author and educator Mark Allen Weiss takes a unique approach by clearly separating the specification and implementation of data structures. He presents the interface and running time of data structures in Part II of the book. Then, he provides the opportunity for readers to use the data structures in a variety of practical examples before introducing the implementations in Part IV. By first gaining a familiarity with the interfaces and uses of data structures, readers will be able to think more abstractly about the subject matter. New utilization of the Java 1.2 Collections API frees the second edition from relying upon a non-standard, book-dependent data structures package. The new edition also features new coverage of Design Patterns and significantly revised material of inheritance. This book is appropriate for readers who are familiar with basic Java programming concepts or are new to the language and want to learn how it treats data structures concepts.
- Addison Wesley
- Publication date:
- Edition description:
- Older Edition
- Product dimensions:
- 7.56(w) x 9.52(h) x 1.52(d)
Table of Contents
(Each Chapter concludes with a “Summary,” “Objects of the Game,” “Common Error,” “On the Internet,” “Exercises,” and “References.” ).
I. TOUR OF JAVA.
The First Program.
2. Reference Types.
Basics of Objects and References.
Input and Output.
3. Objects and Classes.
A Simple Example.
A Design Pattern: Composite (Pair).
Fundamental Inheritance in Java.
Implementing Generic Components.
The Functor (Function Objects).
Dynamic Binding Details.
II. ALGORITHMS AND BUILDING BLOCKS.
Examples of Algorithm Running Times.
The Maximum Contiguous Subsequence Sum Problem.
General Big-Oh Rules.
Static Searching Problem.
Checking an Algorithm Analysis.
Limitations of Big-Oh Analysis.
6. The Collections API.
The Iterator Pattern.
Collections API: Containers and Iterators.
The List Interface.
Stacks and Queues.
Background: Proofs by Mathematical Induction.
8. Sorting Algorithms.
Analysis of the Insertion Sort and Other Simple Sorts.
A Lower Bound for Sorting.
Nonuniform Random Numbers.
Generating a Random Permutation.
Randomized Primality Testing.
The Game of Tic-Tac-Toe.
11. Stacks and Compilers.
A Simple Calculator.
A Cross-reference Generator.
14. Graphs and Paths.
Unweighted Shortest-path Problem.
Positive-weighted, Shortest-path Problem.
Negative-weighted, Shortest-path Problem.
Path Problems in Acyclic Graphs.
Iterators and Inner Classes.
The AbstractCollection Class.
Implementation of ArrayList with an Iterator.
16. Stacks and Queues.
Comparison of the Two Methods.
The java.util.Stack Class.
17. Linked Lists.
Doubly Linked Lists and Circular Linked Lists.
Sorted Linked Lists.
Implementing the Collections API LinkedList Class.
Recursion and Trees.
Tree Traversal: Iterator Classes.
19. Binary Search Trees.
Analysis of Binary Search Tree Operations.
Implementing the Collections API TreeSet and TreeMap Classes.
20. Hash Tables.
Separate Chaining Hashing.
Hash Tables Versus Binary Search Trees.
21. A Priority Queue: The Binary Heap.
Implementation of the Basic Operations.
The buildHeap Operation: Linear-Time Heap Construction.
Advanced Operations: decreaseKey and merge.
Internal Sorting: Heapsort.
V. ADVANCED DATA STRUCTURES.
The Basic Bottom-Up Splay Tree.
Basic Splay Tree Operations.
Analysis of Bottom-Up Splaying.
Top-Down Splay Trees.
Implementation of Top-Down Splay Trees.
Comparison of the Splay Tree with Other Search Trees.
23. Merging Priority Queues.
The Pairing Heap.
24. The Disjoint Set Class.
Dynamic Equivalence and Two Applications.
The Quick-Find Algorithm.
The Quick-Union Algorithm.
Worst Case for Union-by-Rank and Path Compression.
B. Graphical User Interfaces.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >
This book strikes an excellent balance between theory and practice in a subject which can get complex very easily. The first book I attempted to read on this subject was the 'art of computer programming' of Don Knuth but it was too intimidating. Then i went to Algorithm with Java of Bob sedgewick and though it was excellent, the author did not worry about the specific java details. Finally, I get this book and I could understand very well the theoretical aspects of the subject as well as several practical implementation in java which help to clarify many subtleties involved in the algorithms I strongly recommend this book to people that are practical oriented but at the same time want adquire a firm grasp of the subject