Amazon cover image
Image from Amazon.com
Image from Google Jackets

Data structures and abstractions with Java / Frank M. Carrano.

By: Material type: TextTextPublication details: Upper Saddle River, NJ : Pearson/Prentice Hall, c2007.Description: xxii, 998 p. : ill. ; 27 cmISBN:
  • 9780132043670
  • 013237045X
Subject(s): DDC classification:
  • 005.133   22
Contents:
-- 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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Books Books Main library General Stacks 005 .133 / CA.D 2007 (Browse shelf(Opens below)) 1 Available 001763
Books Books Main library General Stacks 005 .133 / CA.D 2007 (Browse shelf(Opens below)) 2 Available 011630

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.

There are no comments on this title.

to post a comment.