Data Structures and Algorithms in Java
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 object-oriented programming, linear structures, algorithms, trees and collections, and advanced topics. KEY FEATURES: Data Structures and Algorithms in Java takes a practical approach to real-world programming and introduces readers to the process of crafting programs by working through the development of projects, often providing multiple versions of the code and consideration for alternate designs. The book features the extensive use of games as examples; a gradual development of classes analogous to the Java Collections Framework; complete, working code in the book and online; and strong pedagogy including extended examples in most chapters along with exercises, problems and projects. For readers and professionals with a familiarity with the basic control structures of Java or C and a precalculus level of mathematics who want to expand their knowledge to Java data structures and algorithms. Ideal for a second undergraduate course in computer science.
What people are saying - Write a review
Other editions - View all
args array ArrayStack B-tree Beetle BeetleGame binary search tree binary tree bit vector BTreeNode call stack cards Chapter child class diagram ColoredLight comparison sort constructor contains data structure Deck deletion digital search tree disk edge element empty example field garbage collector given in Figure GoFish graph hash table heap implementation insertion sort Integer invocation invoked Iterator Java Java collections framework linear linked list LinkedList ListNode item ListNode<E loop merge sort method Figure node null object parent play player private int public boolean public class public int public static final public static void public void Queue Quicksort recursive red-black tree reference remove return false return result Return true root running Section shown in Figure sibling sorting algorithm specified static void main(String subclass subtree takes target topological sort toString traversal UML class diagram variable vertex vertices write