Data Structures and Abstractions with Java
Edition: 2nd 2007 (Revised)
List price: $146.00
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: Using the latest features of Java 5, this unique object-oriented presentation introduces readers to data structures via thirty, manageable chapters. KEY FeaturesTOPICS: Introduces each ADT in its own chapter, including examples or applications. Provides aA variety of exercises and projects, plus additional self-assessment questions throughout. the text Includes generic data types as well as enumerations, for-each loops, the interface Iterable, the class Scanner, assert statements, and autoboxing and unboxing. Identifies important Java code as a Listing. Provides NNotes and Pprogramming Ttips in each chapter. For programmers and software engineers interested in learning more about data structures and abstractions.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $146.00
Copyright year: 2007
Publisher: Prentice Hall PTR
Publication date: 8/4/2006
Size: 8.25" wide x 10.00" long x 1.75" tall
|Creating Classes from Other Classes|
|List Implementations That Use Arrays|
|List Implementations That Link Data|
|Java's Iterator Interfaces|
|The Efficiency of Algorithms|
|An Introduction to Sorting|
|Faster Sorting Methods|
|Inheritance and Lists|
|Mutable, Immutable, and Cloneable Objects|
|Hashing as a Dictionary Implementation|
|Queues, Deques, and Priority Queues|
|Queue, Deque, and Priority Queue Implementations|
|A Binary Search Tree Implementation|
|A Heap Implementation|
|Balanced Search Trees|
|File Input and Output|
|Documentation and Programming Style|
|Answers to Self-Test Questions|