Data Structures and Abstractions with Java

Frank M. Carrano

998 pages, parution le 31/07/2006 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

For one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems.

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.

L'auteur - Frank M. Carrano

Frank M. Carrano's Affiliation: University of Rhode Island

Sommaire

Introduction
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
Appendix A: Java Essentials
Appendix B: Exception Handling
Appendix C: File Input and Output
Appendix D: Documentation and Programming Style
Appendix E: Answers to Self-Test Questions
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Prentice Hall
Auteur(s)	Frank M. Carrano
Parution	31/07/2006
Édition	2^eme édition
Nb. de pages	998
Format	21 x 26
Couverture	Relié
Poids	2023g
Intérieur	2 couleurs
EAN13	9780132370455
ISBN13	978-0-13-237045-5