Data Structures and Algorithms in Java

Name: Data Structures and Algorithms in Java
Price: 14.65 USD
Availability: InStock
ISBN: 9780131469143

ISBN-10: 0131469142

ISBN-13: 9780131469143

Edition: 2006

Authors: Peter Drake

List price: $213.32

30 day, 100% satisfaction guarantee!

Marketplace

3 new & used from $14.65

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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 books five-part structure covers object-oriented programming, linear structures, algorithms, trees and collections, and advanced topics.KEY FEATURES:Data Structures and Algorithms in Javatakes 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 details

List price: $213.32
Copyright year: 2006
Publisher: Pearson Education
Publication date: 12/19/2005
Binding: Paperback
Pages: 608
Size: 7.09" wide x 9.06" long x 1.18" tall
Weight: 1.782
Language: English



Note: Each chapter concludes with a summary, vocabulary, problems, and projects



Object-Oriented Programming



Encapsulation


Software Development


Classes and Objects


Using Objects



Polymorphism


Reference Types


Arrays


Interfaces


Overloading



Inheritance


Extending a Class


The Object Class


Packages and Access Levels



Linear Structures



Stacks and Queues


The Stack Interface


The Call Stack


Exceptions


The Queue Interface



Array-Based Structures


Shrinking and Stretching Arrays


Implementing Stacks and Queues


The List Interface


Iterators


The Java Collections Framework: A First Look



Linked Structures


List Nodes


Stacks and Queues


The LinkedList Class


The Java Collections Framework Revisited



Algorithms



Analysis of Algorithms


Timing


Asymptotic Notation


Counting Steps


Best, Worst, and Average Case


Amortized Analysis



Searching and Sorting


Linear Search


Binary Search


Insertion Sort


The Comparable Interface


Sorting Linked Lists



Recursion


Thinking Recursively


Analyzing Recursive Algorithms


Merge Sort


Quicksort


Avoiding Recursion



Trees and Sets



Trees


Binary Trees


Tree Traversal


General Trees



Sets


The Set Interface


Ordered Lists


Binary Search Trees


Hash Tables


The Java Collections Framework Again



Advanced Topics



Advanced Linear Structures


Bit Vectors


Sparse Arrays


Contiguous Representation of Multidimensional Arrays


Advanced Searching and Sorting



Strings


Strings and StringBuilders


String Matching



Advanced Trees


Heaps


Disjoint Set Clusters


Digital Search Trees


Red-Black Trees



Graphs


Terminology


Representation


Graph Traversal


Topological Sorting


Shortest Paths


Minimum Spanning Trees



Memory Management


Explicit Memory Management


Automatic Memory Management



Out to the Disk


Interacting With Files


Compression


External Sorting


B-Trees


Review of Java Unified Modeling Language Summation Formulae


Further Reading