Data structures and abstractions with Java /
Carrano, Frank M.
Data structures and abstractions with Java / Frank M. Carrano. - Upper Saddle River, NJ : Pearson/Prentice Hall, c2007. - xxii, 998 p. : ill. ; 27 cm.
Includes index.
Java Classes -- Creating Classes from Other Classes -- Designing Classes -- Lists -- List Implementations That Use Arrays -- A List Implementation That Links Data -- Completing the Linked Implementation of a List -- Iterators -- The Efficiency of Algorithms -- Recursion -- An Introduction to Sorting -- Faster Sorting Methods -- Sorted Lists -- Inheritance and Lists -- Mutable, Immutable, and Cloneable Objects -- Searching -- Dictionaries -- Dictionary Implementations -- Introducing Hashing -- Hashing as a Dictionary Implementation -- Stacks -- Stack Implementations -- Queues, Deques, and Priority Queues -- Queue, Deque, and Priority Queue Implementations -- Trees -- Tree Implementations -- A Binary Search Tree Implementation -- A Heap Implementation -- Balanced Search Trees -- Graphs -- Graph Implementations.
This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters – each with pedagogical tools to help students master each concept. Using the latest features of Java 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
9780132043670 013237045X
2006287176
Programming
Data structures (Computer science)
Java (Computer program language)
005.133
Data structures and abstractions with Java / Frank M. Carrano. - Upper Saddle River, NJ : Pearson/Prentice Hall, c2007. - xxii, 998 p. : ill. ; 27 cm.
Includes index.
Java Classes -- Creating Classes from Other Classes -- Designing Classes -- Lists -- List Implementations That Use Arrays -- A List Implementation That Links Data -- Completing the Linked Implementation of a List -- Iterators -- The Efficiency of Algorithms -- Recursion -- An Introduction to Sorting -- Faster Sorting Methods -- Sorted Lists -- Inheritance and Lists -- Mutable, Immutable, and Cloneable Objects -- Searching -- Dictionaries -- Dictionary Implementations -- Introducing Hashing -- Hashing as a Dictionary Implementation -- Stacks -- Stack Implementations -- Queues, Deques, and Priority Queues -- Queue, Deque, and Priority Queue Implementations -- Trees -- Tree Implementations -- A Binary Search Tree Implementation -- A Heap Implementation -- Balanced Search Trees -- Graphs -- Graph Implementations.
This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters – each with pedagogical tools to help students master each concept. Using the latest features of Java 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
9780132043670 013237045X
2006287176
Programming
Data structures (Computer science)
Java (Computer program language)
005.133