Data Structures and Abstractions with Java

Frank M. Carrano, Walter J. Savitch

864 pages, parution le 24/02/2003

Ajouter à une liste

Indisponible

Résumé

For one-semester Introductory courses or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. Focusing on the specification and implementation of ADTs, this book shows students how to use and implement data organizations such as dictionary, graph, and tree. Its unique presentation divides the material into short segments that are organized into small chapters. This makes learning easier for the student and allows for flexibility in the order in which topics are covered.

Features:

Short chapters, gives instructor greater flexibility in covering material. Gives students information in tight, focused segments so as to not overwhelm them.
Separation of specification and implementation of ADTs into individual but consecutive chapters, emphasizes for students the distinction between specification and implementation. Allows instructor to cover topics sequentially or delay coverage of implementation chapters.
Chapters organized into sections, and sections into numbered segments, helps students focus their attention on one issue at a time. Gives students visual cues to identify the segments via segment numbers and the design of the book. Encourages students to master each segment before continuing and gives them a sense of progress and organization.
Numerous figures, helps make the presentation more visual and less imposing.
Highlighted notes, emphasizes key material and provides supplementary comments.
Programming Tips, focuses students on programming issues.
Self-Test Questions throughout chapter - With answers at the back of the book, encourages students to practice the concepts and helps them discover the implications of what they just read.
Comments within Java code in javadoc style, shows students the standard documentation style for Java programs.
Accompanying CD-ROM, gives students a visual learning aid beyond the text.

Contents

Introduction
Java Classes
Creating Classes from Other Classes
Designing Classes
Lists
List Implementations That Use Arrays
List Implementations That Link Data
Iterators
Java's Iterator Interfaces
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
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 I/O
Appendix D: Documentation and Programming Style
Appendix E: Java Resources
Appendix F: Answers to Self-Test Questions

L'auteur - Frank M. Carrano

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

L'auteur - Walter J. Savitch

Walter Savitch

is a Professor of Computer Science at the University of California at San Diego, where he has been one of the main designers of the computer science curriculum. A well-known and respected author, he has written widely on complexity theory and on computational linguistics, and published a textbook on computability theory.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Prentice Hall
Auteur(s)	Frank M. Carrano, Walter J. Savitch
Parution	24/02/2003
Nb. de pages	864
Format	20,7 x 26
Couverture	Relié
Poids	1713g
Intérieur	2 couleurs
EAN13	9780130174895